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-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:10:51,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:10:51,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:10:51,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:10:51,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:10:51,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:10:51,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:10:51,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:10:51,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:10:51,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:10:51,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:10:51,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:10:51,817 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:10:51,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:10:51,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:10:51,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:10:51,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:10:51,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:10:51,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:10:51,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:10:51,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:10:51,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:10:51,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:10:51,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:10:51,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:10:51,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:10:51,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:10:51,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:10:51,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:10:51,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:10:51,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:10:51,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:10:51,855 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:10:51,855 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:10:51,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:10:51,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:10:51,859 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:10:51,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:10:51,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:10:51,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:10:51,879 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:10:51,879 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:10:51,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:10:51,879 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:10:51,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:10:51,880 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:10:51,880 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:10:51,880 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:10:51,880 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:10:51,881 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:10:51,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:10:51,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:10:51,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:10:51,882 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:10:51,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:10:51,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:10:51,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:10:51,883 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:10:51,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:10:51,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:10:51,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:10:51,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:10:51,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:10:51,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:10:51,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:10:51,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:10:51,884 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:10:51,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:10:51,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:10:51,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:10:51,885 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:10:51,885 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:10:51,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:10:51,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:10:51,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:10:51,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:10:51,955 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:10:51,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 22:10:52,020 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583d51f9f/38f1fe10fb634a6192428b51e113eb26/FLAG43c9fac2b [2018-11-07 22:10:52,442 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:10:52,442 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 22:10:52,449 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583d51f9f/38f1fe10fb634a6192428b51e113eb26/FLAG43c9fac2b [2018-11-07 22:10:52,462 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583d51f9f/38f1fe10fb634a6192428b51e113eb26 [2018-11-07 22:10:52,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:10:52,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:10:52,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:52,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:10:52,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:10:52,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a4a07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52, skipping insertion in model container [2018-11-07 22:10:52,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:10:52,523 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:10:52,763 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:52,767 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:10:52,797 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:52,813 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:10:52,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52 WrapperNode [2018-11-07 22:10:52,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:52,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:52,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:10:52,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:10:52,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:52,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:10:52,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:10:52,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:10:52,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (1/1) ... [2018-11-07 22:10:52,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:10:52,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:10:52,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:10:52,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:10:52,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (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 22:10:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:10:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:10:53,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:10:53,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:10:53,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:10:53,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:10:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:10:53,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:10:53,502 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:10:53,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:53 BoogieIcfgContainer [2018-11-07 22:10:53,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:10:53,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:10:53,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:10:53,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:10:53,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:52" (1/3) ... [2018-11-07 22:10:53,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b64af29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:53, skipping insertion in model container [2018-11-07 22:10:53,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:52" (2/3) ... [2018-11-07 22:10:53,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b64af29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:53, skipping insertion in model container [2018-11-07 22:10:53,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:53" (3/3) ... [2018-11-07 22:10:53,518 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 22:10:53,528 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:10:53,536 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:10:53,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:10:53,585 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:10:53,585 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:10:53,585 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:10:53,585 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:10:53,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:10:53,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:10:53,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:10:53,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:10:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 22:10:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:10:53,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:53,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:53,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:53,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 62896836, now seen corresponding path program 1 times [2018-11-07 22:10:53,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:53,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:53,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:53,722 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 22:10:53,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:53,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:10:53,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:53,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:10:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:10:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:10:53,747 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 22:10:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:53,771 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-07 22:10:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:10:53,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-07 22:10:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:53,782 INFO L225 Difference]: With dead ends: 52 [2018-11-07 22:10:53,782 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 22:10:53,785 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 22:10:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 22:10:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 22:10:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 22:10:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-07 22:10:53,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-07 22:10:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:53,822 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-07 22:10:53,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:10:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-07 22:10:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:10:53,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:53,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:53,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:53,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -111227420, now seen corresponding path program 1 times [2018-11-07 22:10:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:53,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:53,942 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 22:10:53,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:53,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:10:53,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:53,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:10:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:10:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:10:53,946 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-07 22:10:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:54,054 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 22:10:54,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:10:54,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 22:10:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:54,056 INFO L225 Difference]: With dead ends: 35 [2018-11-07 22:10:54,056 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:10:54,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:10:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:10:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 22:10:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 22:10:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-07 22:10:54,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 20 [2018-11-07 22:10:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:54,067 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-07 22:10:54,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:10:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-07 22:10:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:10:54,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:54,069 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:54,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:54,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1352658359, now seen corresponding path program 1 times [2018-11-07 22:10:54,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:54,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:54,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:10:54,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:54,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:10:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:10:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:10:54,203 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-07 22:10:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:54,536 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-07 22:10:54,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:10:54,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 22:10:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:54,541 INFO L225 Difference]: With dead ends: 57 [2018-11-07 22:10:54,541 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 22:10:54,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:10:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 22:10:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-07 22:10:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:10:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 22:10:54,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2018-11-07 22:10:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:54,554 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 22:10:54,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:10:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 22:10:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 22:10:54,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:54,556 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:54,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:54,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -38707475, now seen corresponding path program 1 times [2018-11-07 22:10:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:54,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:54,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:54,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:54,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:54,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 22:10:54,730 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [13], [21], [25], [29], [31], [34], [36], [40], [44], [50], [52], [57], [63], [66], [68], [71], [73], [74], [75], [76], [78], [79] [2018-11-07 22:10:54,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:54,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:55,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:55,200 INFO L272 AbstractInterpreter]: Visited 26 different actions 171 times. Merged at 10 different actions 78 times. Widened at 3 different actions 9 times. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 22:10:55,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:55,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:55,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:55,221 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 22:10:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:55,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:55,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:55,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2018-11-07 22:10:55,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:55,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:10:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:10:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:10:55,723 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-11-07 22:10:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:56,342 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-07 22:10:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:10:56,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 22:10:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:56,345 INFO L225 Difference]: With dead ends: 72 [2018-11-07 22:10:56,345 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 22:10:56,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:10:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 22:10:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-07 22:10:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 22:10:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 22:10:56,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2018-11-07 22:10:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:56,356 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 22:10:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:10:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 22:10:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 22:10:56,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:56,359 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:56,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:56,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1515908604, now seen corresponding path program 2 times [2018-11-07 22:10:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:10:56,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:56,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:56,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:56,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:56,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:56,509 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 22:10:56,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:56,528 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:56,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:10:56,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:56,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:10:56,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:10:56,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:56,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2018-11-07 22:10:56,970 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:56,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:10:56,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:10:56,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:10:56,972 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 14 states. [2018-11-07 22:10:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:57,614 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-07 22:10:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:10:57,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 22:10:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:57,618 INFO L225 Difference]: With dead ends: 92 [2018-11-07 22:10:57,618 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 22:10:57,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:10:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 22:10:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-07 22:10:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 22:10:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-07 22:10:57,629 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 44 [2018-11-07 22:10:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:57,629 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-07 22:10:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:10:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-07 22:10:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 22:10:57,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:57,631 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:57,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:57,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 775099085, now seen corresponding path program 3 times [2018-11-07 22:10:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:57,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:57,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:10:57,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:57,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:57,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:57,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:57,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:57,867 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 22:10:57,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:10:57,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:10:57,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:10:57,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:57,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:10:58,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:10:58,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2018-11-07 22:10:58,212 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:58,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:10:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:10:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:10:58,214 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 14 states. [2018-11-07 22:10:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:58,442 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-11-07 22:10:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:10:58,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-07 22:10:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:58,444 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:10:58,444 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 22:10:58,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:10:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 22:10:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2018-11-07 22:10:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 22:10:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-07 22:10:58,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 56 [2018-11-07 22:10:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:58,458 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-07 22:10:58,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:10:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-07 22:10:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:10:58,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:58,459 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:58,459 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:58,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash -916783191, now seen corresponding path program 4 times [2018-11-07 22:10:58,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:58,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:58,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:10:58,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:58,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:58,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:58,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:58,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:58,700 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 22:10:58,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:58,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:58,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:10:58,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:10:58,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:58,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2018-11-07 22:10:58,896 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:58,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:10:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:10:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:10:58,897 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-11-07 22:10:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:59,062 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-07 22:10:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:10:59,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-07 22:10:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:59,065 INFO L225 Difference]: With dead ends: 72 [2018-11-07 22:10:59,065 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 22:10:59,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:10:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 22:10:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-07 22:10:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 22:10:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-07 22:10:59,074 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2018-11-07 22:10:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:59,075 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-07 22:10:59,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:10:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-07 22:10:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 22:10:59,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:59,077 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:59,077 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:59,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 928258569, now seen corresponding path program 5 times [2018-11-07 22:10:59,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:10:59,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:59,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:59,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:59,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:59,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:59,284 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 22:10:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:59,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:59,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:10:59,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:59,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:10:59,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:10:59,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:59,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-07 22:10:59,830 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:10:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:10:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:10:59,831 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 19 states. [2018-11-07 22:11:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:00,270 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2018-11-07 22:11:00,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:11:00,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-11-07 22:11:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:00,272 INFO L225 Difference]: With dead ends: 135 [2018-11-07 22:11:00,273 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 22:11:00,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:11:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 22:11:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2018-11-07 22:11:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:11:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-11-07 22:11:00,283 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 77 [2018-11-07 22:11:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:00,283 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-11-07 22:11:00,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:11:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-07 22:11:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 22:11:00,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:00,285 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:00,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:00,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -846983507, now seen corresponding path program 6 times [2018-11-07 22:11:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:00,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:00,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:00,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:00,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:00,992 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:00,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:00,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:00,992 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 22:11:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:01,002 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:01,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:01,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:01,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:01,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:01,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2018-11-07 22:11:01,560 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:11:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:11:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:11:01,562 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 20 states. [2018-11-07 22:11:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:02,035 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2018-11-07 22:11:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:11:02,036 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-07 22:11:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:02,037 INFO L225 Difference]: With dead ends: 141 [2018-11-07 22:11:02,038 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 22:11:02,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:11:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 22:11:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2018-11-07 22:11:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 22:11:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-07 22:11:02,049 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 80 [2018-11-07 22:11:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:02,049 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-07 22:11:02,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:11:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-07 22:11:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 22:11:02,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:02,051 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:02,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:02,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1143613321, now seen corresponding path program 7 times [2018-11-07 22:11:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 72 proven. 78 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:11:02,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:02,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:02,278 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:02,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:02,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:02,278 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 22:11:02,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:02,292 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:02,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:02,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:02,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:02,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2018-11-07 22:11:02,673 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:02,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:11:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:11:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:11:02,675 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 14 states. [2018-11-07 22:11:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:02,876 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-07 22:11:02,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:11:02,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-07 22:11:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:02,879 INFO L225 Difference]: With dead ends: 90 [2018-11-07 22:11:02,879 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 22:11:02,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:11:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 22:11:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-07 22:11:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 22:11:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-07 22:11:02,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 83 [2018-11-07 22:11:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:02,889 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-07 22:11:02,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:11:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-07 22:11:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 22:11:02,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:02,891 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:02,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:02,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 643631593, now seen corresponding path program 8 times [2018-11-07 22:11:02,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:02,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:03,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:03,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:03,146 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:03,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:03,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:03,147 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 22:11:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:03,157 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:03,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:11:03,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:03,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:03,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-07 22:11:03,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:03,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:11:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:11:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:11:03,872 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 25 states. [2018-11-07 22:11:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:04,206 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-11-07 22:11:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:11:04,208 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2018-11-07 22:11:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:04,209 INFO L225 Difference]: With dead ends: 175 [2018-11-07 22:11:04,209 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 22:11:04,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:11:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 22:11:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 91. [2018-11-07 22:11:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 22:11:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-11-07 22:11:04,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 101 [2018-11-07 22:11:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:04,218 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-11-07 22:11:04,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:11:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-11-07 22:11:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 22:11:04,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:04,220 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:04,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:04,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1746775411, now seen corresponding path program 9 times [2018-11-07 22:11:04,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:04,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:04,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:04,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:04,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:04,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:04,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:04,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 22:11:04,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:04,468 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 22:11:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:04,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:04,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:04,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:04,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:04,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:05,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:05,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2018-11-07 22:11:05,014 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:05,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:11:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:11:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:11:05,015 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 26 states. [2018-11-07 22:11:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:05,498 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2018-11-07 22:11:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:11:05,498 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-11-07 22:11:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:05,500 INFO L225 Difference]: With dead ends: 181 [2018-11-07 22:11:05,500 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 22:11:05,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 186 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:11:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 22:11:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2018-11-07 22:11:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 22:11:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-11-07 22:11:05,509 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 104 [2018-11-07 22:11:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:05,510 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-11-07 22:11:05,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:11:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-11-07 22:11:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 22:11:05,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:05,512 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:05,512 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:05,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 490903401, now seen corresponding path program 10 times [2018-11-07 22:11:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:05,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:05,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 121 proven. 145 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:05,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:05,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:05,766 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:05,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:05,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:05,766 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 22:11:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:05,774 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:05,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:05,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:11:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 17 [2018-11-07 22:11:06,072 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:11:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:11:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:11:06,073 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 16 states. [2018-11-07 22:11:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:06,247 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-07 22:11:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:11:06,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2018-11-07 22:11:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:06,250 INFO L225 Difference]: With dead ends: 110 [2018-11-07 22:11:06,250 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 22:11:06,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 206 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:11:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 22:11:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-07 22:11:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 22:11:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-11-07 22:11:06,259 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 107 [2018-11-07 22:11:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:06,260 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-11-07 22:11:06,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:11:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-11-07 22:11:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 22:11:06,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:06,262 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:06,262 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:06,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1091747383, now seen corresponding path program 11 times [2018-11-07 22:11:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:06,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:06,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:06,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:06,609 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:06,609 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:06,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:06,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:06,609 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 22:11:06,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:06,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:06,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:11:06,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:06,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:07,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:07,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:07,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-07 22:11:07,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:07,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:11:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:11:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:11:07,253 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 31 states. [2018-11-07 22:11:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:07,642 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-11-07 22:11:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:11:07,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2018-11-07 22:11:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:07,644 INFO L225 Difference]: With dead ends: 215 [2018-11-07 22:11:07,644 INFO L226 Difference]: Without dead ends: 156 [2018-11-07 22:11:07,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 223 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:11:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-07 22:11:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 111. [2018-11-07 22:11:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 22:11:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-07 22:11:07,655 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 125 [2018-11-07 22:11:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:07,655 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-07 22:11:07,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:11:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-07 22:11:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 22:11:07,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:07,657 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:07,657 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:07,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1980489325, now seen corresponding path program 12 times [2018-11-07 22:11:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:07,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:07,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:07,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:07,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:07,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:07,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:07,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:07,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:07,983 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 22:11:07,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:07,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:08,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:08,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:08,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:08,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:08,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 32 [2018-11-07 22:11:08,481 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:08,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:11:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:11:08,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:11:08,482 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 32 states. [2018-11-07 22:11:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:09,169 INFO L93 Difference]: Finished difference Result 221 states and 259 transitions. [2018-11-07 22:11:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:11:09,170 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2018-11-07 22:11:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:09,172 INFO L225 Difference]: With dead ends: 221 [2018-11-07 22:11:09,172 INFO L226 Difference]: Without dead ends: 164 [2018-11-07 22:11:09,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 228 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:11:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-07 22:11:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-11-07 22:11:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 22:11:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-07 22:11:09,182 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 128 [2018-11-07 22:11:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:09,182 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-07 22:11:09,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:11:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-07 22:11:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 22:11:09,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:09,183 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:09,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:09,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1231179593, now seen corresponding path program 13 times [2018-11-07 22:11:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:09,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:09,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 182 proven. 232 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:09,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:09,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:09,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:09,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:09,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:09,449 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 22:11:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:09,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:09,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:09,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:11:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 19 [2018-11-07 22:11:09,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:11:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:11:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:11:09,732 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 18 states. [2018-11-07 22:11:10,008 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 22:11:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:10,119 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-07 22:11:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:11:10,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-11-07 22:11:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:10,122 INFO L225 Difference]: With dead ends: 130 [2018-11-07 22:11:10,122 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 22:11:10,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 252 SyntacticMatches, 19 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:11:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 22:11:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-07 22:11:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:11:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-11-07 22:11:10,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 131 [2018-11-07 22:11:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:10,131 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-11-07 22:11:10,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:11:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-07 22:11:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 22:11:10,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:10,133 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:10,133 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:10,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2109554263, now seen corresponding path program 14 times [2018-11-07 22:11:10,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:10,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:10,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:10,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:10,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:10,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:10,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:10,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:10,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:10,897 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 22:11:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:10,907 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:10,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:11:10,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:10,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:11,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:12,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:12,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-07 22:11:12,010 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:12,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:11:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:11:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:11:12,012 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 37 states. [2018-11-07 22:11:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:13,195 INFO L93 Difference]: Finished difference Result 255 states and 297 transitions. [2018-11-07 22:11:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:11:13,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-11-07 22:11:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:13,198 INFO L225 Difference]: With dead ends: 255 [2018-11-07 22:11:13,198 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 22:11:13,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 265 SyntacticMatches, 20 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:11:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 22:11:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 131. [2018-11-07 22:11:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 22:11:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-07 22:11:13,209 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 149 [2018-11-07 22:11:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:13,209 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-07 22:11:13,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:11:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-07 22:11:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 22:11:13,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:13,211 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:13,211 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:13,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1564389965, now seen corresponding path program 15 times [2018-11-07 22:11:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:13,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:13,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:14,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:14,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:14,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:14,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:14,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:14,014 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 22:11:14,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:14,023 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:14,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:14,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:14,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:14,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:14,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 38 [2018-11-07 22:11:14,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:14,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:11:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:11:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:11:14,730 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 38 states. [2018-11-07 22:11:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:15,245 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2018-11-07 22:11:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:11:15,245 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 152 [2018-11-07 22:11:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:15,247 INFO L225 Difference]: With dead ends: 261 [2018-11-07 22:11:15,247 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 22:11:15,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 270 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:11:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 22:11:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 134. [2018-11-07 22:11:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-07 22:11:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-07 22:11:15,258 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 152 [2018-11-07 22:11:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:15,258 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-07 22:11:15,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:11:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-07 22:11:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 22:11:15,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:15,260 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:15,260 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:15,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash -909684951, now seen corresponding path program 16 times [2018-11-07 22:11:15,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:15,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:15,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 255 proven. 339 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:11:15,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:15,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:15,559 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:15,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:15,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:15,559 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 22:11:15,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:15,570 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:15,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:15,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:11:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 21 [2018-11-07 22:11:16,032 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:16,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:11:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:11:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:11:16,033 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 20 states. [2018-11-07 22:11:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:16,442 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-07 22:11:16,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:11:16,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2018-11-07 22:11:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:16,444 INFO L225 Difference]: With dead ends: 150 [2018-11-07 22:11:16,444 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 22:11:16,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 298 SyntacticMatches, 23 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:11:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 22:11:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-07 22:11:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-07 22:11:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-11-07 22:11:16,454 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 155 [2018-11-07 22:11:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:16,454 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-07 22:11:16,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:11:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-11-07 22:11:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 22:11:16,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:16,456 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:16,456 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:16,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash -568620663, now seen corresponding path program 17 times [2018-11-07 22:11:16,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:16,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:16,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:16,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:17,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:17,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:17,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:17,160 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 22:11:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:17,169 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:17,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 22:11:17,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:17,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:17,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-07 22:11:18,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:18,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:11:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:11:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1487, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:11:18,152 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 43 states. [2018-11-07 22:11:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:19,065 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2018-11-07 22:11:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:11:19,067 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-11-07 22:11:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:19,069 INFO L225 Difference]: With dead ends: 295 [2018-11-07 22:11:19,069 INFO L226 Difference]: Without dead ends: 216 [2018-11-07 22:11:19,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 307 SyntacticMatches, 24 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:11:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-07 22:11:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2018-11-07 22:11:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-07 22:11:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-07 22:11:19,081 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 173 [2018-11-07 22:11:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:19,081 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-07 22:11:19,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:11:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-11-07 22:11:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 22:11:19,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:19,083 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:19,083 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:19,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 792251949, now seen corresponding path program 18 times [2018-11-07 22:11:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:19,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:19,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:19,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:19,614 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:19,614 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:19,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:19,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:19,615 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 22:11:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:19,623 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:19,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:19,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:19,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:20,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:20,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 44 [2018-11-07 22:11:20,400 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:20,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:11:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:11:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:11:20,402 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 44 states. [2018-11-07 22:11:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:21,424 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2018-11-07 22:11:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:11:21,424 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2018-11-07 22:11:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:21,426 INFO L225 Difference]: With dead ends: 301 [2018-11-07 22:11:21,426 INFO L226 Difference]: Without dead ends: 224 [2018-11-07 22:11:21,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 312 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=897, Invalid=2409, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:11:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-07 22:11:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 154. [2018-11-07 22:11:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:11:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-07 22:11:21,436 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 176 [2018-11-07 22:11:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:21,436 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-07 22:11:21,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:11:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-07 22:11:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 22:11:21,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:21,438 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:21,438 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1943038199, now seen corresponding path program 19 times [2018-11-07 22:11:21,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:21,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:21,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:21,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:21,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 340 proven. 466 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:11:21,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:21,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:21,855 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:21,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:21,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:21,856 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 22:11:21,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:21,865 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:21,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:21,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:11:22,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:22,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 23 [2018-11-07 22:11:22,248 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:22,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:11:22,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:11:22,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:11:22,249 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 22 states. [2018-11-07 22:11:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:22,447 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-07 22:11:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:11:22,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-07 22:11:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:22,451 INFO L225 Difference]: With dead ends: 170 [2018-11-07 22:11:22,452 INFO L226 Difference]: Without dead ends: 168 [2018-11-07 22:11:22,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 344 SyntacticMatches, 27 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:11:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-07 22:11:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-07 22:11:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 22:11:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-11-07 22:11:22,462 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 179 [2018-11-07 22:11:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:22,463 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-11-07 22:11:22,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:11:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-11-07 22:11:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 22:11:22,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:22,464 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:22,464 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:22,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash 213227881, now seen corresponding path program 20 times [2018-11-07 22:11:22,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:22,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:22,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:23,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:23,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:23,010 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:23,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:23,010 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 22:11:23,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:23,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:23,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 22:11:23,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:23,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:23,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:24,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:24,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-11-07 22:11:24,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:24,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:11:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:11:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1923, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:11:24,556 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 49 states. [2018-11-07 22:11:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:26,523 INFO L93 Difference]: Finished difference Result 335 states and 391 transitions. [2018-11-07 22:11:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:11:26,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 197 [2018-11-07 22:11:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:26,525 INFO L225 Difference]: With dead ends: 335 [2018-11-07 22:11:26,525 INFO L226 Difference]: Without dead ends: 246 [2018-11-07 22:11:26,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 349 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1152, Invalid=3138, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:11:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-07 22:11:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 171. [2018-11-07 22:11:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 22:11:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-11-07 22:11:26,538 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 197 [2018-11-07 22:11:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:26,538 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-11-07 22:11:26,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:11:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-11-07 22:11:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 22:11:26,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:26,540 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:26,540 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1707593203, now seen corresponding path program 21 times [2018-11-07 22:11:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:26,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:26,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:27,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:27,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:27,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:27,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:27,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:27,045 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:27,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:27,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:27,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:27,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:27,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 50 [2018-11-07 22:11:28,349 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:28,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:11:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:11:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:11:28,351 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 50 states. [2018-11-07 22:11:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:30,541 INFO L93 Difference]: Finished difference Result 341 states and 400 transitions. [2018-11-07 22:11:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:11:30,541 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 200 [2018-11-07 22:11:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:30,543 INFO L225 Difference]: With dead ends: 341 [2018-11-07 22:11:30,543 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 22:11:30,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 354 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:11:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 22:11:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-07 22:11:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 22:11:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-11-07 22:11:30,557 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 200 [2018-11-07 22:11:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:30,558 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-11-07 22:11:30,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:11:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-11-07 22:11:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 22:11:30,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:30,559 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:30,559 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:30,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1255745257, now seen corresponding path program 22 times [2018-11-07 22:11:30,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 437 proven. 613 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:11:31,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:31,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:31,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:31,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:31,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:31,624 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:31,633 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:31,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:31,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 22:11:32,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:32,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 25 [2018-11-07 22:11:32,052 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:11:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:11:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:11:32,053 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 24 states. [2018-11-07 22:11:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:32,542 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2018-11-07 22:11:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:11:32,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2018-11-07 22:11:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:32,545 INFO L225 Difference]: With dead ends: 190 [2018-11-07 22:11:32,545 INFO L226 Difference]: Without dead ends: 188 [2018-11-07 22:11:32,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 390 SyntacticMatches, 31 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:11:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-07 22:11:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-11-07 22:11:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 22:11:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-11-07 22:11:32,558 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 203 [2018-11-07 22:11:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:32,558 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-11-07 22:11:32,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:11:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-11-07 22:11:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 22:11:32,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:32,560 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:32,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:32,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash -187764407, now seen corresponding path program 23 times [2018-11-07 22:11:32,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:32,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:33,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:33,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:33,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:33,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:33,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:33,140 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:33,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:33,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:33,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 22:11:33,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:33,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:33,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:34,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:34,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-11-07 22:11:34,652 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:34,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 22:11:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 22:11:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=2415, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:11:34,654 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 55 states. [2018-11-07 22:11:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:35,926 INFO L93 Difference]: Finished difference Result 375 states and 438 transitions. [2018-11-07 22:11:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:11:35,927 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 221 [2018-11-07 22:11:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:35,929 INFO L225 Difference]: With dead ends: 375 [2018-11-07 22:11:35,929 INFO L226 Difference]: Without dead ends: 276 [2018-11-07 22:11:35,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 391 SyntacticMatches, 32 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:11:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-07 22:11:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-11-07 22:11:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 22:11:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-11-07 22:11:35,947 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 221 [2018-11-07 22:11:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:35,948 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-11-07 22:11:35,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 22:11:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-11-07 22:11:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 22:11:35,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:35,950 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:35,950 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:35,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash -117776915, now seen corresponding path program 24 times [2018-11-07 22:11:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:35,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:35,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:36,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,665 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:36,665 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:36,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:36,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,666 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:36,676 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:36,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:36,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:36,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:37,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:38,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:38,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 56 [2018-11-07 22:11:38,246 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:38,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 22:11:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 22:11:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:11:38,248 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 56 states. [2018-11-07 22:11:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:39,774 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-11-07 22:11:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:11:39,774 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 224 [2018-11-07 22:11:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:39,776 INFO L225 Difference]: With dead ends: 381 [2018-11-07 22:11:39,776 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 22:11:39,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 396 SyntacticMatches, 35 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1441, Invalid=3961, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:11:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 22:11:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2018-11-07 22:11:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 22:11:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-11-07 22:11:39,791 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 224 [2018-11-07 22:11:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:39,791 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-11-07 22:11:39,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 22:11:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-11-07 22:11:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 22:11:39,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:39,793 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:39,793 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:39,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1820458697, now seen corresponding path program 25 times [2018-11-07 22:11:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:39,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:39,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 546 proven. 780 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 22:11:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:41,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:41,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:41,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:41,706 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:41,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:41,715 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:41,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:42,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:11:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:42,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 27 [2018-11-07 22:11:42,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:42,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:11:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:11:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:11:42,933 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 26 states. [2018-11-07 22:11:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:43,180 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-11-07 22:11:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:11:43,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 227 [2018-11-07 22:11:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:43,183 INFO L225 Difference]: With dead ends: 210 [2018-11-07 22:11:43,183 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 22:11:43,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 35 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:11:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 22:11:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-11-07 22:11:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-07 22:11:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-11-07 22:11:43,197 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 227 [2018-11-07 22:11:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:43,198 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-11-07 22:11:43,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:11:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-11-07 22:11:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 22:11:43,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:43,200 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:43,200 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:43,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 161845545, now seen corresponding path program 26 times [2018-11-07 22:11:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:43,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:44,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:44,960 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:44,960 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:44,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:44,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:44,960 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:44,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:44,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:45,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 22:11:45,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:45,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:45,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-11-07 22:11:46,290 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:46,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 22:11:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 22:11:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=2963, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:11:46,291 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 61 states. [2018-11-07 22:11:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:47,155 INFO L93 Difference]: Finished difference Result 415 states and 485 transitions. [2018-11-07 22:11:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:11:47,155 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 245 [2018-11-07 22:11:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:47,157 INFO L225 Difference]: With dead ends: 415 [2018-11-07 22:11:47,158 INFO L226 Difference]: Without dead ends: 306 [2018-11-07 22:11:47,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 433 SyntacticMatches, 36 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:11:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-07 22:11:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2018-11-07 22:11:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-07 22:11:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-11-07 22:11:47,173 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 245 [2018-11-07 22:11:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:47,173 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-11-07 22:11:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 22:11:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-11-07 22:11:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 22:11:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:47,175 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:47,175 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:47,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:47,175 INFO L82 PathProgramCache]: Analyzing trace with hash 851366349, now seen corresponding path program 27 times [2018-11-07 22:11:47,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:47,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:47,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:48,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:48,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:48,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:48,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:48,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:48,045 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:48,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:48,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:48,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:48,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:49,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:50,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 62 [2018-11-07 22:11:50,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:50,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 22:11:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 22:11:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2881, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:11:50,134 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 62 states. [2018-11-07 22:11:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:51,219 INFO L93 Difference]: Finished difference Result 421 states and 494 transitions. [2018-11-07 22:11:51,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:11:51,220 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 248 [2018-11-07 22:11:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:51,222 INFO L225 Difference]: With dead ends: 421 [2018-11-07 22:11:51,222 INFO L226 Difference]: Without dead ends: 314 [2018-11-07 22:11:51,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 438 SyntacticMatches, 39 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1761, Invalid=4881, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:11:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-07 22:11:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 214. [2018-11-07 22:11:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 22:11:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-11-07 22:11:51,238 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 248 [2018-11-07 22:11:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:51,239 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-11-07 22:11:51,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 22:11:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-11-07 22:11:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-07 22:11:51,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:51,241 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:51,241 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:51,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -462938455, now seen corresponding path program 28 times [2018-11-07 22:11:51,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:51,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:51,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 667 proven. 967 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:11:51,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:51,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:51,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:51,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:51,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:51,727 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:51,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:51,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:51,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:52,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 22:11:52,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:52,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 29 [2018-11-07 22:11:52,595 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:52,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:11:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:11:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:11:52,596 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 28 states. [2018-11-07 22:11:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:52,905 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2018-11-07 22:11:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:11:52,906 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 251 [2018-11-07 22:11:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:52,908 INFO L225 Difference]: With dead ends: 230 [2018-11-07 22:11:52,908 INFO L226 Difference]: Without dead ends: 228 [2018-11-07 22:11:52,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 482 SyntacticMatches, 39 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:11:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-07 22:11:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-11-07 22:11:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-07 22:11:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 242 transitions. [2018-11-07 22:11:52,923 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 242 transitions. Word has length 251 [2018-11-07 22:11:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:52,923 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 242 transitions. [2018-11-07 22:11:52,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:11:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 242 transitions. [2018-11-07 22:11:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 22:11:52,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:52,925 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:52,925 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:52,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash 720861449, now seen corresponding path program 29 times [2018-11-07 22:11:52,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:52,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:52,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:11:53,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:53,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:53,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:53,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:53,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:53,752 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:53,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:53,760 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:53,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 22:11:53,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:53,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:11:55,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:11:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:55,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-11-07 22:11:55,775 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 22:11:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 22:11:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=3567, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:11:55,777 INFO L87 Difference]: Start difference. First operand 228 states and 242 transitions. Second operand 67 states. [2018-11-07 22:11:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:56,985 INFO L93 Difference]: Finished difference Result 455 states and 532 transitions. [2018-11-07 22:11:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:11:56,985 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 269 [2018-11-07 22:11:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:56,988 INFO L225 Difference]: With dead ends: 455 [2018-11-07 22:11:56,988 INFO L226 Difference]: Without dead ends: 336 [2018-11-07 22:11:56,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 475 SyntacticMatches, 40 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2112, Invalid=5898, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 22:11:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-07 22:11:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 231. [2018-11-07 22:11:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 22:11:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 245 transitions. [2018-11-07 22:11:57,004 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 245 transitions. Word has length 269 [2018-11-07 22:11:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:57,005 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 245 transitions. [2018-11-07 22:11:57,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 22:11:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 245 transitions. [2018-11-07 22:11:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-07 22:11:57,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:57,007 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:57,007 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:57,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1690169939, now seen corresponding path program 30 times [2018-11-07 22:11:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:57,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:57,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:11:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:57,957 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:57,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,957 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:57,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:58,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:58,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:58,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:11:59,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:12:00,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:00,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 68 [2018-11-07 22:12:00,372 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:00,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 22:12:00,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 22:12:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:12:00,374 INFO L87 Difference]: Start difference. First operand 231 states and 245 transitions. Second operand 68 states. [2018-11-07 22:12:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:01,598 INFO L93 Difference]: Finished difference Result 461 states and 541 transitions. [2018-11-07 22:12:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:12:01,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 272 [2018-11-07 22:12:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:01,600 INFO L225 Difference]: With dead ends: 461 [2018-11-07 22:12:01,600 INFO L226 Difference]: Without dead ends: 344 [2018-11-07 22:12:01,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 480 SyntacticMatches, 43 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2113, Invalid=5897, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 22:12:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-07 22:12:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 234. [2018-11-07 22:12:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 22:12:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 248 transitions. [2018-11-07 22:12:01,617 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 248 transitions. Word has length 272 [2018-11-07 22:12:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:01,618 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 248 transitions. [2018-11-07 22:12:01,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 22:12:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 248 transitions. [2018-11-07 22:12:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 22:12:01,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:01,620 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:01,620 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:01,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 306808457, now seen corresponding path program 31 times [2018-11-07 22:12:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 800 proven. 1174 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:12:02,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:02,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:02,066 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:02,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:02,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:02,066 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:02,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:02,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:02,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:12:02,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 22:12:02,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:02,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 31 [2018-11-07 22:12:02,802 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:02,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:12:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:12:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:12:02,803 INFO L87 Difference]: Start difference. First operand 234 states and 248 transitions. Second operand 30 states. [2018-11-07 22:12:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,205 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-11-07 22:12:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:12:03,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 275 [2018-11-07 22:12:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,207 INFO L225 Difference]: With dead ends: 250 [2018-11-07 22:12:03,208 INFO L226 Difference]: Without dead ends: 248 [2018-11-07 22:12:03,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 528 SyntacticMatches, 43 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:12:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-07 22:12:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-07 22:12:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 22:12:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-11-07 22:12:03,223 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 275 [2018-11-07 22:12:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,223 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-11-07 22:12:03,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:12:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-11-07 22:12:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 22:12:03,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,225 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,226 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2063423255, now seen corresponding path program 32 times [2018-11-07 22:12:03,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:04,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:04,742 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:04,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:04,742 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:04,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:04,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:04,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 22:12:04,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:04,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:06,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-11-07 22:12:06,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:06,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 22:12:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 22:12:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1323, Invalid=4227, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:12:06,871 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 73 states. [2018-11-07 22:12:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:08,232 INFO L93 Difference]: Finished difference Result 495 states and 579 transitions. [2018-11-07 22:12:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:12:08,233 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 293 [2018-11-07 22:12:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:08,234 INFO L225 Difference]: With dead ends: 495 [2018-11-07 22:12:08,234 INFO L226 Difference]: Without dead ends: 366 [2018-11-07 22:12:08,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 517 SyntacticMatches, 44 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:12:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-07 22:12:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 251. [2018-11-07 22:12:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 22:12:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 266 transitions. [2018-11-07 22:12:08,252 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 266 transitions. Word has length 293 [2018-11-07 22:12:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:08,253 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 266 transitions. [2018-11-07 22:12:08,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 22:12:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2018-11-07 22:12:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 22:12:08,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:08,255 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:08,255 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:08,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash -759000691, now seen corresponding path program 33 times [2018-11-07 22:12:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:09,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:09,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:09,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:09,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:09,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:09,454 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:09,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:09,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:09,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:09,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:11,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:11,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 74 [2018-11-07 22:12:11,984 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:11,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-11-07 22:12:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-07 22:12:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:12:11,986 INFO L87 Difference]: Start difference. First operand 251 states and 266 transitions. Second operand 74 states. [2018-11-07 22:12:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:13,280 INFO L93 Difference]: Finished difference Result 501 states and 588 transitions. [2018-11-07 22:12:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:12:13,280 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 296 [2018-11-07 22:12:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:13,282 INFO L225 Difference]: With dead ends: 501 [2018-11-07 22:12:13,282 INFO L226 Difference]: Without dead ends: 374 [2018-11-07 22:12:13,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 522 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:12:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-07 22:12:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 254. [2018-11-07 22:12:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-07 22:12:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 269 transitions. [2018-11-07 22:12:13,298 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 269 transitions. Word has length 296 [2018-11-07 22:12:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:13,299 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 269 transitions. [2018-11-07 22:12:13,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-11-07 22:12:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 269 transitions. [2018-11-07 22:12:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-07 22:12:13,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:13,301 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:13,301 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:13,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1570490775, now seen corresponding path program 34 times [2018-11-07 22:12:13,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:13,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:13,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 945 proven. 1401 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-07 22:12:13,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:13,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:13,812 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:13,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:13,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:13,813 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:13,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:13,820 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:13,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:14,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 22:12:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:14,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 33 [2018-11-07 22:12:14,685 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:14,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:12:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:12:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:12:14,686 INFO L87 Difference]: Start difference. First operand 254 states and 269 transitions. Second operand 32 states. [2018-11-07 22:12:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:15,061 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-11-07 22:12:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:12:15,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 299 [2018-11-07 22:12:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:15,065 INFO L225 Difference]: With dead ends: 270 [2018-11-07 22:12:15,065 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 22:12:15,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 574 SyntacticMatches, 47 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:12:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 22:12:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-11-07 22:12:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-07 22:12:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2018-11-07 22:12:15,083 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 299 [2018-11-07 22:12:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:15,084 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2018-11-07 22:12:15,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:12:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2018-11-07 22:12:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-07 22:12:15,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:15,086 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:15,086 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:15,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1887772873, now seen corresponding path program 35 times [2018-11-07 22:12:15,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:16,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:16,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:16,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,991 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:16,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:17,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 22:12:17,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:17,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:18,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:19,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:19,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-11-07 22:12:19,199 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:19,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-07 22:12:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-07 22:12:19,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1537, Invalid=4943, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:12:19,200 INFO L87 Difference]: Start difference. First operand 268 states and 284 transitions. Second operand 79 states. [2018-11-07 22:12:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:21,022 INFO L93 Difference]: Finished difference Result 535 states and 626 transitions. [2018-11-07 22:12:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 22:12:21,022 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 317 [2018-11-07 22:12:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:21,024 INFO L225 Difference]: With dead ends: 535 [2018-11-07 22:12:21,024 INFO L226 Difference]: Without dead ends: 396 [2018-11-07 22:12:21,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 559 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 22:12:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-07 22:12:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-11-07 22:12:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-07 22:12:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 287 transitions. [2018-11-07 22:12:21,043 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 287 transitions. Word has length 317 [2018-11-07 22:12:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:21,043 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 287 transitions. [2018-11-07 22:12:21,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-07 22:12:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 287 transitions. [2018-11-07 22:12:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-07 22:12:21,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:21,045 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:21,046 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:21,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1510056595, now seen corresponding path program 36 times [2018-11-07 22:12:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:23,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:23,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:23,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:23,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:23,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:23,003 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:23,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:23,011 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:23,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:23,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:23,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:24,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:25,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 80 [2018-11-07 22:12:25,220 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 22:12:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 22:12:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:12:25,222 INFO L87 Difference]: Start difference. First operand 271 states and 287 transitions. Second operand 80 states. [2018-11-07 22:12:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:27,083 INFO L93 Difference]: Finished difference Result 541 states and 635 transitions. [2018-11-07 22:12:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 22:12:27,083 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 320 [2018-11-07 22:12:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:27,086 INFO L225 Difference]: With dead ends: 541 [2018-11-07 22:12:27,086 INFO L226 Difference]: Without dead ends: 404 [2018-11-07 22:12:27,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 564 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2913, Invalid=8217, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 22:12:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-07 22:12:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 274. [2018-11-07 22:12:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 22:12:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 290 transitions. [2018-11-07 22:12:27,106 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 290 transitions. Word has length 320 [2018-11-07 22:12:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:27,106 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 290 transitions. [2018-11-07 22:12:27,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 22:12:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 290 transitions. [2018-11-07 22:12:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 22:12:27,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:27,109 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:27,109 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1836461641, now seen corresponding path program 37 times [2018-11-07 22:12:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1102 proven. 1648 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-07 22:12:27,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:27,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:27,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:27,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:27,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:27,831 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:27,839 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:27,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:28,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 22:12:29,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:29,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 35 [2018-11-07 22:12:29,520 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:12:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:12:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:12:29,521 INFO L87 Difference]: Start difference. First operand 274 states and 290 transitions. Second operand 34 states. [2018-11-07 22:12:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:29,873 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-11-07 22:12:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:12:29,874 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 323 [2018-11-07 22:12:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:29,876 INFO L225 Difference]: With dead ends: 290 [2018-11-07 22:12:29,876 INFO L226 Difference]: Without dead ends: 288 [2018-11-07 22:12:29,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 620 SyntacticMatches, 51 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:12:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-07 22:12:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-07 22:12:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-07 22:12:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 305 transitions. [2018-11-07 22:12:29,890 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 305 transitions. Word has length 323 [2018-11-07 22:12:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:29,891 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 305 transitions. [2018-11-07 22:12:29,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:12:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 305 transitions. [2018-11-07 22:12:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-07 22:12:29,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:29,893 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:29,894 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1388109993, now seen corresponding path program 38 times [2018-11-07 22:12:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:29,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:29,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:31,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:31,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:31,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:31,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,494 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:31,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:31,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:31,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-07 22:12:31,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:31,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:32,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:34,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:34,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-11-07 22:12:34,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:34,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 22:12:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 22:12:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5715, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:12:34,783 INFO L87 Difference]: Start difference. First operand 288 states and 305 transitions. Second operand 85 states. [2018-11-07 22:12:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:36,588 INFO L93 Difference]: Finished difference Result 575 states and 673 transitions. [2018-11-07 22:12:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 22:12:36,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 341 [2018-11-07 22:12:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:36,591 INFO L225 Difference]: With dead ends: 575 [2018-11-07 22:12:36,591 INFO L226 Difference]: Without dead ends: 426 [2018-11-07 22:12:36,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 601 SyntacticMatches, 52 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3360, Invalid=9522, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 22:12:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-07 22:12:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 291. [2018-11-07 22:12:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-07 22:12:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 308 transitions. [2018-11-07 22:12:36,611 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 308 transitions. Word has length 341 [2018-11-07 22:12:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:36,611 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 308 transitions. [2018-11-07 22:12:36,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 22:12:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 308 transitions. [2018-11-07 22:12:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-07 22:12:36,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:36,613 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:36,614 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:36,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -298618547, now seen corresponding path program 39 times [2018-11-07 22:12:36,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:36,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:36,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:37,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:37,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:37,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:37,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:37,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:37,885 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:37,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:37,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:37,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:38,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:39,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:41,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:41,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 86 [2018-11-07 22:12:41,454 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:41,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-11-07 22:12:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-11-07 22:12:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 22:12:41,455 INFO L87 Difference]: Start difference. First operand 291 states and 308 transitions. Second operand 86 states. [2018-11-07 22:12:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:43,177 INFO L93 Difference]: Finished difference Result 581 states and 682 transitions. [2018-11-07 22:12:43,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 22:12:43,178 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 344 [2018-11-07 22:12:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:43,180 INFO L225 Difference]: With dead ends: 581 [2018-11-07 22:12:43,180 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 22:12:43,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 606 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3361, Invalid=9521, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 22:12:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 22:12:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 294. [2018-11-07 22:12:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 22:12:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 311 transitions. [2018-11-07 22:12:43,201 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 311 transitions. Word has length 344 [2018-11-07 22:12:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:43,201 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 311 transitions. [2018-11-07 22:12:43,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-11-07 22:12:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 311 transitions. [2018-11-07 22:12:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 22:12:43,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:43,204 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:43,204 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:43,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1488809513, now seen corresponding path program 40 times [2018-11-07 22:12:43,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:43,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:43,206 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1271 proven. 1915 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-07 22:12:44,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:44,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:44,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:44,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:44,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:44,376 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:44,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:44,387 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:44,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:44,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 22:12:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 37 [2018-11-07 22:12:45,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:45,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:12:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:12:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:12:45,376 INFO L87 Difference]: Start difference. First operand 294 states and 311 transitions. Second operand 36 states. [2018-11-07 22:12:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:45,802 INFO L93 Difference]: Finished difference Result 310 states and 328 transitions. [2018-11-07 22:12:45,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:12:45,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-11-07 22:12:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:45,805 INFO L225 Difference]: With dead ends: 310 [2018-11-07 22:12:45,805 INFO L226 Difference]: Without dead ends: 308 [2018-11-07 22:12:45,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 666 SyntacticMatches, 55 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:12:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-07 22:12:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-11-07 22:12:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-07 22:12:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2018-11-07 22:12:45,820 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 347 [2018-11-07 22:12:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:45,821 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2018-11-07 22:12:45,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:12:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2018-11-07 22:12:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-07 22:12:45,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:45,823 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:45,824 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:45,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2103961737, now seen corresponding path program 41 times [2018-11-07 22:12:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:45,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:45,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:47,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:47,156 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:47,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:47,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,157 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:47,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:47,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:47,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 22:12:47,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:47,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:48,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:50,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-11-07 22:12:50,075 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:50,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-07 22:12:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-07 22:12:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2013, Invalid=6543, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:12:50,077 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 91 states. [2018-11-07 22:12:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:52,074 INFO L93 Difference]: Finished difference Result 615 states and 720 transitions. [2018-11-07 22:12:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 22:12:52,075 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 365 [2018-11-07 22:12:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:52,076 INFO L225 Difference]: With dead ends: 615 [2018-11-07 22:12:52,076 INFO L226 Difference]: Without dead ends: 456 [2018-11-07 22:12:52,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 643 SyntacticMatches, 56 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 22:12:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-07 22:12:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 311. [2018-11-07 22:12:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-07 22:12:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 329 transitions. [2018-11-07 22:12:52,098 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 329 transitions. Word has length 365 [2018-11-07 22:12:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:52,098 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 329 transitions. [2018-11-07 22:12:52,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-07 22:12:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 329 transitions. [2018-11-07 22:12:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-07 22:12:52,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:52,101 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:52,101 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:52,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1897909549, now seen corresponding path program 42 times [2018-11-07 22:12:52,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:52,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:52,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:53,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:53,590 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:53,590 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:53,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:53,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:53,590 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:53,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:53,598 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:53,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:53,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:55,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:56,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:56,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 92 [2018-11-07 22:12:56,676 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:56,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-11-07 22:12:56,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-11-07 22:12:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:12:56,678 INFO L87 Difference]: Start difference. First operand 311 states and 329 transitions. Second operand 92 states. [2018-11-07 22:12:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:58,590 INFO L93 Difference]: Finished difference Result 621 states and 729 transitions. [2018-11-07 22:12:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 22:12:58,590 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 368 [2018-11-07 22:12:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:58,592 INFO L225 Difference]: With dead ends: 621 [2018-11-07 22:12:58,592 INFO L226 Difference]: Without dead ends: 464 [2018-11-07 22:12:58,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 648 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3841, Invalid=10921, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 22:12:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-07 22:12:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 314. [2018-11-07 22:12:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-07 22:12:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 332 transitions. [2018-11-07 22:12:58,615 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 332 transitions. Word has length 368 [2018-11-07 22:12:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:58,615 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 332 transitions. [2018-11-07 22:12:58,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-11-07 22:12:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 332 transitions. [2018-11-07 22:12:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-07 22:12:58,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:58,618 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:58,618 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:58,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash 905442825, now seen corresponding path program 43 times [2018-11-07 22:12:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:58,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:58,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1452 proven. 2202 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-07 22:12:59,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:59,440 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:59,440 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:59,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:59,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:59,440 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:59,450 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:59,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:12:59,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 22:13:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:00,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 39 [2018-11-07 22:13:00,646 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:00,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:13:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:13:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:13:00,648 INFO L87 Difference]: Start difference. First operand 314 states and 332 transitions. Second operand 38 states. [2018-11-07 22:13:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:01,033 INFO L93 Difference]: Finished difference Result 330 states and 349 transitions. [2018-11-07 22:13:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:13:01,034 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 371 [2018-11-07 22:13:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:01,036 INFO L225 Difference]: With dead ends: 330 [2018-11-07 22:13:01,036 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 22:13:01,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 712 SyntacticMatches, 59 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:13:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 22:13:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-07 22:13:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-07 22:13:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 347 transitions. [2018-11-07 22:13:01,054 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 347 transitions. Word has length 371 [2018-11-07 22:13:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:01,055 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 347 transitions. [2018-11-07 22:13:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:13:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 347 transitions. [2018-11-07 22:13:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 22:13:01,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:01,058 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:01,058 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:01,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 247740521, now seen corresponding path program 44 times [2018-11-07 22:13:01,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:01,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:01,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:01,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:01,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:02,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:02,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:02,739 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:02,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:02,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:02,740 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:02,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:02,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:02,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 22:13:02,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:02,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:04,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-11-07 22:13:05,882 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 22:13:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 22:13:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2275, Invalid=7427, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 22:13:05,883 INFO L87 Difference]: Start difference. First operand 328 states and 347 transitions. Second operand 97 states. [2018-11-07 22:13:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:12,438 INFO L93 Difference]: Finished difference Result 655 states and 767 transitions. [2018-11-07 22:13:12,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 22:13:12,438 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 389 [2018-11-07 22:13:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:12,440 INFO L225 Difference]: With dead ends: 655 [2018-11-07 22:13:12,440 INFO L226 Difference]: Without dead ends: 486 [2018-11-07 22:13:12,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 685 SyntacticMatches, 60 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5951 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 22:13:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-07 22:13:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 331. [2018-11-07 22:13:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-07 22:13:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 350 transitions. [2018-11-07 22:13:12,459 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 350 transitions. Word has length 389 [2018-11-07 22:13:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:12,459 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 350 transitions. [2018-11-07 22:13:12,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 22:13:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 350 transitions. [2018-11-07 22:13:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-07 22:13:12,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:12,462 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:12,462 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:12,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1056870131, now seen corresponding path program 45 times [2018-11-07 22:13:12,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:12,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:12,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:13,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:13,910 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:13,910 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:13,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:13,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:13,911 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:13,921 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:14,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:14,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:14,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:15,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:17,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:17,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 98 [2018-11-07 22:13:17,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:17,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-07 22:13:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-07 22:13:17,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2209, Invalid=7297, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:13:17,365 INFO L87 Difference]: Start difference. First operand 331 states and 350 transitions. Second operand 98 states. [2018-11-07 22:13:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:19,381 INFO L93 Difference]: Finished difference Result 661 states and 776 transitions. [2018-11-07 22:13:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 22:13:19,381 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 392 [2018-11-07 22:13:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:19,384 INFO L225 Difference]: With dead ends: 661 [2018-11-07 22:13:19,385 INFO L226 Difference]: Without dead ends: 494 [2018-11-07 22:13:19,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 690 SyntacticMatches, 63 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4353, Invalid=12417, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 22:13:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-07 22:13:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 334. [2018-11-07 22:13:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 22:13:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 353 transitions. [2018-11-07 22:13:19,409 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 353 transitions. Word has length 392 [2018-11-07 22:13:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:19,409 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 353 transitions. [2018-11-07 22:13:19,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-07 22:13:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 353 transitions. [2018-11-07 22:13:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 22:13:19,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:19,411 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:19,412 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:19,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1553742359, now seen corresponding path program 46 times [2018-11-07 22:13:19,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:19,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:19,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1645 proven. 2509 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-07 22:13:20,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:20,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:20,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:20,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:20,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:20,128 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:20,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:20,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:20,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:20,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 22:13:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:21,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 41 [2018-11-07 22:13:21,371 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:21,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:13:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:13:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:13:21,372 INFO L87 Difference]: Start difference. First operand 334 states and 353 transitions. Second operand 40 states. [2018-11-07 22:13:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:21,905 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-11-07 22:13:21,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:13:21,906 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 395 [2018-11-07 22:13:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:21,908 INFO L225 Difference]: With dead ends: 350 [2018-11-07 22:13:21,908 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 22:13:21,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 758 SyntacticMatches, 63 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:13:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 22:13:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-11-07 22:13:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-07 22:13:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 368 transitions. [2018-11-07 22:13:21,927 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 368 transitions. Word has length 395 [2018-11-07 22:13:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:21,928 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 368 transitions. [2018-11-07 22:13:21,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:13:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 368 transitions. [2018-11-07 22:13:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-07 22:13:21,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:21,931 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:21,931 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:21,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash -779104183, now seen corresponding path program 47 times [2018-11-07 22:13:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:21,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:21,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:23,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,567 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:23,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:23,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:23,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,567 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:23,575 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:23,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-07 22:13:23,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:23,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:25,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:27,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:27,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-11-07 22:13:27,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:27,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-11-07 22:13:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-11-07 22:13:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2553, Invalid=8367, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 22:13:27,485 INFO L87 Difference]: Start difference. First operand 348 states and 368 transitions. Second operand 103 states. [2018-11-07 22:13:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:29,903 INFO L93 Difference]: Finished difference Result 695 states and 814 transitions. [2018-11-07 22:13:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 22:13:29,904 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 413 [2018-11-07 22:13:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:29,906 INFO L225 Difference]: With dead ends: 695 [2018-11-07 22:13:29,906 INFO L226 Difference]: Without dead ends: 516 [2018-11-07 22:13:29,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 727 SyntacticMatches, 64 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4896, Invalid=14010, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 22:13:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-11-07 22:13:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 351. [2018-11-07 22:13:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 22:13:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 371 transitions. [2018-11-07 22:13:29,925 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 371 transitions. Word has length 413 [2018-11-07 22:13:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:29,925 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 371 transitions. [2018-11-07 22:13:29,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-11-07 22:13:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 371 transitions. [2018-11-07 22:13:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-07 22:13:29,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:29,928 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:29,928 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:29,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 479616237, now seen corresponding path program 48 times [2018-11-07 22:13:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:31,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:31,649 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:31,649 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:31,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 22:13:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:31,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:31,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:31,658 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:31,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:31,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:31,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:33,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:35,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:35,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 104 [2018-11-07 22:13:35,438 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:35,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 22:13:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 22:13:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2483, Invalid=8229, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 22:13:35,440 INFO L87 Difference]: Start difference. First operand 351 states and 371 transitions. Second operand 104 states. [2018-11-07 22:13:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:38,151 INFO L93 Difference]: Finished difference Result 701 states and 823 transitions. [2018-11-07 22:13:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 22:13:38,151 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 416 [2018-11-07 22:13:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:38,154 INFO L225 Difference]: With dead ends: 701 [2018-11-07 22:13:38,154 INFO L226 Difference]: Without dead ends: 524 [2018-11-07 22:13:38,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 732 SyntacticMatches, 67 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4897, Invalid=14009, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 22:13:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-07 22:13:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 354. [2018-11-07 22:13:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-07 22:13:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2018-11-07 22:13:38,182 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 416 [2018-11-07 22:13:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:38,183 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2018-11-07 22:13:38,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 22:13:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2018-11-07 22:13:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-07 22:13:38,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:38,186 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:38,186 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:38,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash -339812919, now seen corresponding path program 49 times [2018-11-07 22:13:38,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1850 proven. 2836 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-07 22:13:39,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:39,153 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:39,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:39,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,153 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:39,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:39,162 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:39,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 22:13:40,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:40,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 43 [2018-11-07 22:13:40,453 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:40,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:13:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:13:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:13:40,454 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand 42 states. [2018-11-07 22:13:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:40,978 INFO L93 Difference]: Finished difference Result 370 states and 391 transitions. [2018-11-07 22:13:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:13:40,978 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 419 [2018-11-07 22:13:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:40,981 INFO L225 Difference]: With dead ends: 370 [2018-11-07 22:13:40,981 INFO L226 Difference]: Without dead ends: 368 [2018-11-07 22:13:40,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 804 SyntacticMatches, 67 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:13:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-07 22:13:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-11-07 22:13:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-07 22:13:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 389 transitions. [2018-11-07 22:13:41,002 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 389 transitions. Word has length 419 [2018-11-07 22:13:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:41,003 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 389 transitions. [2018-11-07 22:13:41,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:13:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 389 transitions. [2018-11-07 22:13:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-07 22:13:41,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:41,006 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:41,006 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:41,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash 487108649, now seen corresponding path program 50 times [2018-11-07 22:13:41,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:41,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:43,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:43,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:43,156 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:43,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:43,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:43,156 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:43,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:43,166 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:43,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 22:13:43,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:43,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:45,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:47,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:47,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-11-07 22:13:47,091 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:47,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-11-07 22:13:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-11-07 22:13:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2847, Invalid=9363, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 22:13:47,093 INFO L87 Difference]: Start difference. First operand 368 states and 389 transitions. Second operand 109 states. [2018-11-07 22:13:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:49,846 INFO L93 Difference]: Finished difference Result 735 states and 861 transitions. [2018-11-07 22:13:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 22:13:49,846 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 437 [2018-11-07 22:13:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:49,849 INFO L225 Difference]: With dead ends: 735 [2018-11-07 22:13:49,849 INFO L226 Difference]: Without dead ends: 546 [2018-11-07 22:13:49,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 769 SyntacticMatches, 68 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7559 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5472, Invalid=15698, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 22:13:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-07 22:13:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2018-11-07 22:13:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-07 22:13:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 392 transitions. [2018-11-07 22:13:49,869 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 392 transitions. Word has length 437 [2018-11-07 22:13:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:49,869 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 392 transitions. [2018-11-07 22:13:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-11-07 22:13:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 392 transitions. [2018-11-07 22:13:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 22:13:49,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:49,872 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:49,872 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:49,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1327272141, now seen corresponding path program 51 times [2018-11-07 22:13:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:49,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:49,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:51,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,698 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:51,698 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:51,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:51,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,699 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:51,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:51,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:51,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:51,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:54,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:13:56,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:56,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 110 [2018-11-07 22:13:56,272 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:56,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-11-07 22:13:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-11-07 22:13:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2773, Invalid=9217, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:13:56,274 INFO L87 Difference]: Start difference. First operand 371 states and 392 transitions. Second operand 110 states. [2018-11-07 22:13:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:59,148 INFO L93 Difference]: Finished difference Result 741 states and 870 transitions. [2018-11-07 22:13:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 22:13:59,148 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 440 [2018-11-07 22:13:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:59,151 INFO L225 Difference]: With dead ends: 741 [2018-11-07 22:13:59,151 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 22:13:59,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 774 SyntacticMatches, 71 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5473, Invalid=15697, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 22:13:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 22:13:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 374. [2018-11-07 22:13:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-07 22:13:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 395 transitions. [2018-11-07 22:13:59,173 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 395 transitions. Word has length 440 [2018-11-07 22:13:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:59,173 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 395 transitions. [2018-11-07 22:13:59,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-11-07 22:13:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 395 transitions. [2018-11-07 22:13:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-11-07 22:13:59,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:59,175 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:59,175 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:59,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -431538775, now seen corresponding path program 52 times [2018-11-07 22:13:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:59,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:59,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2067 proven. 3183 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-07 22:14:00,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:00,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:00,211 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:00,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:00,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:00,211 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:00,221 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:00,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:14:00,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 22:14:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:01,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 45 [2018-11-07 22:14:01,636 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:01,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:14:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:14:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:14:01,637 INFO L87 Difference]: Start difference. First operand 374 states and 395 transitions. Second operand 44 states. [2018-11-07 22:14:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:02,223 INFO L93 Difference]: Finished difference Result 390 states and 412 transitions. [2018-11-07 22:14:02,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:14:02,224 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 443 [2018-11-07 22:14:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:02,226 INFO L225 Difference]: With dead ends: 390 [2018-11-07 22:14:02,226 INFO L226 Difference]: Without dead ends: 388 [2018-11-07 22:14:02,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 850 SyntacticMatches, 71 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:14:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-07 22:14:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-11-07 22:14:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 22:14:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 410 transitions. [2018-11-07 22:14:02,246 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 410 transitions. Word has length 443 [2018-11-07 22:14:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:02,246 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 410 transitions. [2018-11-07 22:14:02,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:14:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 410 transitions. [2018-11-07 22:14:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-07 22:14:02,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:02,249 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:02,249 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:02,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1259546615, now seen corresponding path program 53 times [2018-11-07 22:14:02,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:04,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:04,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:04,558 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:04,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:04,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:04,558 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:04,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:04,567 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:04,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 22:14:04,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:04,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:07,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:09,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-11-07 22:14:09,332 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:09,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-11-07 22:14:09,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-11-07 22:14:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3157, Invalid=10415, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 22:14:09,334 INFO L87 Difference]: Start difference. First operand 388 states and 410 transitions. Second operand 115 states. [2018-11-07 22:14:12,799 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 22:14:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:12,948 INFO L93 Difference]: Finished difference Result 775 states and 908 transitions. [2018-11-07 22:14:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-07 22:14:12,948 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 461 [2018-11-07 22:14:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:12,950 INFO L225 Difference]: With dead ends: 775 [2018-11-07 22:14:12,951 INFO L226 Difference]: Without dead ends: 576 [2018-11-07 22:14:12,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 811 SyntacticMatches, 72 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=6080, Invalid=17482, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 22:14:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-07 22:14:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2018-11-07 22:14:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-11-07 22:14:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 413 transitions. [2018-11-07 22:14:12,976 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 413 transitions. Word has length 461 [2018-11-07 22:14:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:12,977 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 413 transitions. [2018-11-07 22:14:12,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-11-07 22:14:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 413 transitions. [2018-11-07 22:14:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-11-07 22:14:12,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:12,979 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:12,979 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:12,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1873670995, now seen corresponding path program 54 times [2018-11-07 22:14:12,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:15,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:15,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:15,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:15,027 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:15,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:15,040 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:15,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:15,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:15,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:17,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:19,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 116 [2018-11-07 22:14:19,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:19,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-07 22:14:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-07 22:14:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=10261, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 22:14:19,731 INFO L87 Difference]: Start difference. First operand 391 states and 413 transitions. Second operand 116 states. [2018-11-07 22:14:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:23,052 INFO L93 Difference]: Finished difference Result 781 states and 917 transitions. [2018-11-07 22:14:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-07 22:14:23,052 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 464 [2018-11-07 22:14:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:23,054 INFO L225 Difference]: With dead ends: 781 [2018-11-07 22:14:23,054 INFO L226 Difference]: Without dead ends: 584 [2018-11-07 22:14:23,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 816 SyntacticMatches, 75 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8362 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6081, Invalid=17481, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 22:14:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-07 22:14:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 394. [2018-11-07 22:14:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-07 22:14:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 416 transitions. [2018-11-07 22:14:23,078 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 416 transitions. Word has length 464 [2018-11-07 22:14:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:23,078 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 416 transitions. [2018-11-07 22:14:23,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-07 22:14:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 416 transitions. [2018-11-07 22:14:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-07 22:14:23,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:23,081 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:23,081 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:23,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash -692394615, now seen corresponding path program 55 times [2018-11-07 22:14:23,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:23,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:23,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2296 proven. 3550 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-11-07 22:14:24,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:24,196 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:24,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:24,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,196 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:24,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:24,206 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:24,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:24,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 22:14:25,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 47 [2018-11-07 22:14:25,827 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:25,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:14:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:14:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=1289, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:14:25,828 INFO L87 Difference]: Start difference. First operand 394 states and 416 transitions. Second operand 46 states. [2018-11-07 22:14:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:26,454 INFO L93 Difference]: Finished difference Result 410 states and 433 transitions. [2018-11-07 22:14:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:14:26,455 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 467 [2018-11-07 22:14:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:26,457 INFO L225 Difference]: With dead ends: 410 [2018-11-07 22:14:26,458 INFO L226 Difference]: Without dead ends: 408 [2018-11-07 22:14:26,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 896 SyntacticMatches, 75 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=886, Invalid=1466, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:14:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-07 22:14:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-11-07 22:14:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-07 22:14:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 431 transitions. [2018-11-07 22:14:26,480 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 431 transitions. Word has length 467 [2018-11-07 22:14:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:26,480 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 431 transitions. [2018-11-07 22:14:26,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:14:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 431 transitions. [2018-11-07 22:14:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-07 22:14:26,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:26,483 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:26,483 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:26,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1451603991, now seen corresponding path program 56 times [2018-11-07 22:14:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:26,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 22:14:28,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:28,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:28,874 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:28,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:28,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:28,874 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:28,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:28,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:29,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-07 22:14:29,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:29,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 22:14:31,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 22:14:33,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:33,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-11-07 22:14:33,979 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:33,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-11-07 22:14:33,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-11-07 22:14:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=11523, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 22:14:33,981 INFO L87 Difference]: Start difference. First operand 408 states and 431 transitions. Second operand 121 states. [2018-11-07 22:14:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:37,085 INFO L93 Difference]: Finished difference Result 815 states and 955 transitions. [2018-11-07 22:14:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-07 22:14:37,090 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 485 [2018-11-07 22:14:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:37,093 INFO L225 Difference]: With dead ends: 815 [2018-11-07 22:14:37,093 INFO L226 Difference]: Without dead ends: 606 [2018-11-07 22:14:37,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 853 SyntacticMatches, 76 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9359 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=6720, Invalid=19362, Unknown=0, NotChecked=0, Total=26082 [2018-11-07 22:14:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-07 22:14:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 411. [2018-11-07 22:14:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-07 22:14:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 434 transitions. [2018-11-07 22:14:37,117 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 434 transitions. Word has length 485 [2018-11-07 22:14:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:37,117 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 434 transitions. [2018-11-07 22:14:37,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-11-07 22:14:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 434 transitions. [2018-11-07 22:14:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-11-07 22:14:37,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:37,120 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:37,120 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:37,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1685377165, now seen corresponding path program 57 times [2018-11-07 22:14:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:37,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:37,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 22:14:38,587 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:14:38,592 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:14:38,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:14:38 BoogieIcfgContainer [2018-11-07 22:14:38,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:14:38,593 INFO L168 Benchmark]: Toolchain (without parser) took 226117.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 170.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:38,593 INFO L168 Benchmark]: CDTParser took 0.21 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 22:14:38,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.82 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 22:14:38,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.64 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 22:14:38,595 INFO L168 Benchmark]: Boogie Preprocessor took 25.95 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 22:14:38,595 INFO L168 Benchmark]: RCFGBuilder took 637.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:38,596 INFO L168 Benchmark]: TraceAbstraction took 225088.52 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 457.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -250.8 MB). Peak memory consumption was 206.9 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:38,599 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.21 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. * CACSL2BoogieTranslator took 337.82 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 23.64 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 25.95 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 637.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225088.52 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 457.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -250.8 MB). Peak memory consumption was 206.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 489 with TraceHistMax 40,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 225.0s OverallTime, 60 OverallIterations, 40 TraceHistogramMax, 69.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4798 SDtfs, 9849 SDslu, 47934 SDs, 0 SdLazy, 38252 SolverSat, 5510 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32427 GetRequests, 26432 SyntacticMatches, 2237 SemanticMatches, 3758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136409 ImplicationChecksByTransitivity, 145.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 59 MinimizatonAttempts, 3905 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 140.4s InterpolantComputationTime, 29161 NumberOfCodeBlocks, 29161 NumberOfCodeBlocksAsserted, 531 NumberOfCheckSat, 43538 ConstructedInterpolants, 0 QuantifiedInterpolants, 42473608 SizeOfPredicates, 150 NumberOfNonLiveVariables, 35027 ConjunctsInSsa, 2516 ConjunctsInUnsatCore, 171 InterpolantComputations, 3 PerfectInterpolantSequences, 368269/527315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown