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/seq_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:11:58,922 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:11:58,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:11:58,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:11:58,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:11:58,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:11:58,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:11:58,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:11:58,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:11:58,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:11:58,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:11:58,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:11:58,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:11:58,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:11:58,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:11:58,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:11:58,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:11:58,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:11:58,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:11:58,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:11:58,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:11:58,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:11:58,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:11:58,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:11:58,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:11:58,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:11:58,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:11:58,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:11:58,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:11:58,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:11:58,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:11:58,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:11:58,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:11:58,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:11:58,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:11:58,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:11:58,972 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:11:59,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:11:59,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:11:59,003 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:11:59,004 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:11:59,004 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:11:59,004 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:11:59,004 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:11:59,005 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:11:59,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:11:59,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:11:59,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:11:59,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:11:59,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:11:59,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:11:59,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:11:59,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:11:59,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:11:59,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:11:59,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:11:59,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:11:59,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:11:59,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:11:59,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:11:59,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:11:59,012 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:11:59,012 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:11:59,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:11:59,012 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:11:59,012 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:11:59,013 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:11:59,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:11:59,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:11:59,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:11:59,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:11:59,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:11:59,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-07 22:11:59,145 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78e0bdce/f050ab1bb8c34789b8c7bb44197690af/FLAGc9a2312da [2018-11-07 22:11:59,623 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:11:59,623 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-07 22:11:59,629 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78e0bdce/f050ab1bb8c34789b8c7bb44197690af/FLAGc9a2312da [2018-11-07 22:11:59,641 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78e0bdce/f050ab1bb8c34789b8c7bb44197690af [2018-11-07 22:11:59,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:11:59,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:11:59,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:59,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:11:59,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:11:59,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c28240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59, skipping insertion in model container [2018-11-07 22:11:59,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:11:59,700 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:11:59,895 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:59,899 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:11:59,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:59,940 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:11:59,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59 WrapperNode [2018-11-07 22:11:59,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:59,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:59,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:11:59,942 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:11:59,950 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:11:59" (1/1) ... [2018-11-07 22:11:59,956 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:11:59" (1/1) ... [2018-11-07 22:11:59,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:59,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:11:59,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:11:59,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:11:59,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (1/1) ... [2018-11-07 22:11:59,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:11:59,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:11:59,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:11:59,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:11:59,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (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:12:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:12:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:12:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:12:00,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:12:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:12:00,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:12:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:12:00,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:12:00,473 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:12:00,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:00 BoogieIcfgContainer [2018-11-07 22:12:00,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:12:00,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:12:00,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:12:00,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:12:00,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:59" (1/3) ... [2018-11-07 22:12:00,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f08b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:00, skipping insertion in model container [2018-11-07 22:12:00,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:59" (2/3) ... [2018-11-07 22:12:00,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f08b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:00, skipping insertion in model container [2018-11-07 22:12:00,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:00" (3/3) ... [2018-11-07 22:12:00,482 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i [2018-11-07 22:12:00,492 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:12:00,500 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:12:00,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:12:00,553 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:12:00,553 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:12:00,553 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:12:00,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:12:00,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:12:00,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:12:00,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:12:00,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:12:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 22:12:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:12:00,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:00,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:00,584 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:00,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash 301890663, now seen corresponding path program 1 times [2018-11-07 22:12:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:00,712 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:12:00,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:00,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:12:00,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:12:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:12:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:12:00,737 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 22:12:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:00,762 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-07 22:12:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:12:00,764 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 22:12:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:00,773 INFO L225 Difference]: With dead ends: 45 [2018-11-07 22:12:00,773 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 22:12:00,777 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:12:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 22:12:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 22:12:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 22:12:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-07 22:12:00,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2018-11-07 22:12:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:00,819 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-07 22:12:00,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:12:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-07 22:12:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:12:00,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:00,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:00,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:00,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1130037681, now seen corresponding path program 1 times [2018-11-07 22:12:00,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:01,176 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:12:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 22:12:01,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:01,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:12:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:12:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:01,180 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-07 22:12:01,611 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 22:12:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:01,687 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-07 22:12:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:01,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 22:12:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:01,691 INFO L225 Difference]: With dead ends: 48 [2018-11-07 22:12:01,691 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 22:12:01,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:12:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 22:12:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-07 22:12:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 22:12:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-07 22:12:01,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-07 22:12:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:01,704 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-07 22:12:01,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:12:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-07 22:12:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:12:01,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:01,706 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:01,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:01,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1499928661, now seen corresponding path program 1 times [2018-11-07 22:12:01,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:01,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:01,810 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:01,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:01,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:01,812 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-07 22:12:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:01,917 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-07 22:12:01,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:12:01,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 22:12:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:01,920 INFO L225 Difference]: With dead ends: 42 [2018-11-07 22:12:01,921 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 22:12:01,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 22:12:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-07 22:12:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:12:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 22:12:01,930 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-11-07 22:12:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 22:12:01,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 22:12:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:12:01,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:01,932 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:01,932 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:01,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1355895601, now seen corresponding path program 1 times [2018-11-07 22:12:01,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:01,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:02,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:02,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:02,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 22:12:02,149 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 22:12:02,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:02,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:02,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:02,546 INFO L272 AbstractInterpreter]: Visited 24 different actions 134 times. Merged at 8 different actions 55 times. Widened at 3 different actions 8 times. Found 8 fixpoints after 3 different actions. Largest state had 12 variables. [2018-11-07 22:12:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:02,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:02,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:02,583 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:12:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:02,594 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:02,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:03,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:03,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:03,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-11-07 22:12:03,392 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:03,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:12:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:12:03,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:03,393 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 14 states. [2018-11-07 22:12:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,719 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-07 22:12:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:12:03,720 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-07 22:12:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,723 INFO L225 Difference]: With dead ends: 64 [2018-11-07 22:12:03,723 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 22:12:03,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:12:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 22:12:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-07 22:12:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 22:12:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 22:12:03,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-11-07 22:12:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,733 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 22:12:03,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:12:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 22:12:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:12:03,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,735 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,735 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash 95654235, now seen corresponding path program 1 times [2018-11-07 22:12:03,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:03,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,877 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:03,877 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 22:12:03,878 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 22:12:03,880 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:03,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:04,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:04,106 INFO L272 AbstractInterpreter]: Visited 24 different actions 162 times. Merged at 11 different actions 77 times. Widened at 4 different actions 11 times. Found 8 fixpoints after 4 different actions. Largest state had 12 variables. [2018-11-07 22:12:04,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:04,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:04,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:04,150 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:12:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:04,168 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:04,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:04,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:04,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:04,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-07 22:12:04,604 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:04,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:12:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:12:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:12:04,606 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 13 states. [2018-11-07 22:12:05,089 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 22:12:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:05,154 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-07 22:12:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:12:05,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-07 22:12:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:05,157 INFO L225 Difference]: With dead ends: 79 [2018-11-07 22:12:05,158 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 22:12:05,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:12:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 22:12:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2018-11-07 22:12:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 22:12:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-07 22:12:05,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2018-11-07 22:12:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:05,169 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-07 22:12:05,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:12:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-07 22:12:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 22:12:05,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:05,171 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:05,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:05,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash -446111159, now seen corresponding path program 2 times [2018-11-07 22:12:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:05,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:05,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:05,286 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:05,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,286 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:12:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:05,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:05,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:12:05,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:05,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:05,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:05,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-07 22:12:05,423 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:05,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:12:05,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:12:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:12:05,424 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 10 states. [2018-11-07 22:12:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:05,567 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-07 22:12:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:12:05,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-07 22:12:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:05,569 INFO L225 Difference]: With dead ends: 50 [2018-11-07 22:12:05,569 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 22:12:05,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:12:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 22:12:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 22:12:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 22:12:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-07 22:12:05,578 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 31 [2018-11-07 22:12:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:05,579 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-07 22:12:05,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:12:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-07 22:12:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 22:12:05,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:05,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:05,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:05,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 94447981, now seen corresponding path program 3 times [2018-11-07 22:12:05,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:05,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:05,837 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:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,837 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:12:05,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:05,846 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:05,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:05,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:05,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:06,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2018-11-07 22:12:06,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:12:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:12:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:12:06,199 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 18 states. [2018-11-07 22:12:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:06,629 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-07 22:12:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:12:06,633 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-07 22:12:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:06,635 INFO L225 Difference]: With dead ends: 87 [2018-11-07 22:12:06,635 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 22:12:06,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 22:12:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-07 22:12:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:12:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 22:12:06,646 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-07 22:12:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:06,647 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 22:12:06,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:12:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 22:12:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 22:12:06,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:06,648 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:06,649 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:06,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 594202361, now seen corresponding path program 1 times [2018-11-07 22:12:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:06,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:06,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:06,780 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-07 22:12:06,781 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 22:12:06,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:06,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:06,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:06,949 INFO L272 AbstractInterpreter]: Visited 25 different actions 215 times. Merged at 12 different actions 101 times. Widened at 5 different actions 16 times. Found 19 fixpoints after 5 different actions. Largest state had 14 variables. [2018-11-07 22:12:06,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:06,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:06,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:06,980 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:12:06,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:06,989 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:07,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:07,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:07,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:07,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-11-07 22:12:07,331 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:07,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:12:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:12:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:12:07,333 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 17 states. [2018-11-07 22:12:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:07,639 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2018-11-07 22:12:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:12:07,639 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 22:12:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:07,641 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:12:07,641 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 22:12:07,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:12:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 22:12:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2018-11-07 22:12:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:12:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 22:12:07,654 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-07 22:12:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:07,654 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 22:12:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:12:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 22:12:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 22:12:07,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:07,655 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:07,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:07,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1103599739, now seen corresponding path program 2 times [2018-11-07 22:12:07,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:07,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:07,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:07,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:07,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:07,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:07,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:12:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:07,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:07,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:12:07,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:07,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:08,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:08,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:08,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-11-07 22:12:08,437 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:08,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:12:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:12:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:12:08,438 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-11-07 22:12:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:08,780 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-11-07 22:12:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:12:08,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-07 22:12:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:08,782 INFO L225 Difference]: With dead ends: 122 [2018-11-07 22:12:08,782 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 22:12:08,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 22:12:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 53. [2018-11-07 22:12:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 22:12:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-07 22:12:08,797 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2018-11-07 22:12:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:08,798 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-07 22:12:08,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:12:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-07 22:12:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 22:12:08,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:08,799 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:08,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:08,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:08,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1990570393, now seen corresponding path program 4 times [2018-11-07 22:12:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,801 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:12:08,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:08,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:08,901 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:08,901 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:08,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:08,901 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:12:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:08,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:08,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:08,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:12:09,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:09,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-07 22:12:09,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:09,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:12:09,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:12:09,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:12:09,074 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-11-07 22:12:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:09,562 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-07 22:12:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:12:09,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-07 22:12:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:09,564 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:12:09,564 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 22:12:09,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:12:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 22:12:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-07 22:12:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 22:12:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-07 22:12:09,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2018-11-07 22:12:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:09,581 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-07 22:12:09,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:12:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-07 22:12:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:12:09,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:09,586 INFO L375 BasicCegarLoop]: trace histogram [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:12:09,586 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:09,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1735104395, now seen corresponding path program 5 times [2018-11-07 22:12:09,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:09,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:09,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:09,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:10,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:10,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:10,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:10,050 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:10,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:10,051 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:12:10,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:10,061 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:10,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:12:10,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:10,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:10,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2018-11-07 22:12:10,561 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:10,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:12:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:12:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:12:10,563 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 22 states. [2018-11-07 22:12:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:11,010 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2018-11-07 22:12:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:12:11,019 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-07 22:12:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:11,020 INFO L225 Difference]: With dead ends: 110 [2018-11-07 22:12:11,020 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 22:12:11,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:12:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 22:12:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2018-11-07 22:12:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:12:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 22:12:11,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 22:12:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:11,045 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 22:12:11,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:12:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 22:12:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:12:11,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:11,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:11,049 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:11,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1916583447, now seen corresponding path program 2 times [2018-11-07 22:12:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:11,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:11,202 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:11,202 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:11,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,203 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:12:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:11,212 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:11,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:12:11,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:11,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:11,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:11,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-07 22:12:11,941 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:11,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:12:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:12:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:12:11,942 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-11-07 22:12:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:12,288 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-07 22:12:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:12:12,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-07 22:12:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:12,289 INFO L225 Difference]: With dead ends: 132 [2018-11-07 22:12:12,290 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 22:12:12,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:12:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 22:12:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2018-11-07 22:12:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:12:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 22:12:12,303 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 22:12:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:12,303 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 22:12:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:12:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 22:12:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:12:12,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:12,305 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:12,305 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:12,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -402778205, now seen corresponding path program 3 times [2018-11-07 22:12:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:12,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:12,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:12,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:12,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:12,489 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:12,489 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:12,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:12,489 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:12:12,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:12,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:12,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:12,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:12,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:12,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:12,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2018-11-07 22:12:12,727 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:12,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:12:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:12:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:12:12,729 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 20 states. [2018-11-07 22:12:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:13,086 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2018-11-07 22:12:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:12:13,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-11-07 22:12:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:13,092 INFO L225 Difference]: With dead ends: 152 [2018-11-07 22:12:13,092 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 22:12:13,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:12:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 22:12:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2018-11-07 22:12:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:12:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 22:12:13,107 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 22:12:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:13,107 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 22:12:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:12:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 22:12:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:12:13,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:13,109 INFO L375 BasicCegarLoop]: trace histogram [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:12:13,109 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:13,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 488662063, now seen corresponding path program 3 times [2018-11-07 22:12:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:13,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:13,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:13,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:13,313 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:13,313 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:13,313 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,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:13,313 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:12:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:13,325 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:13,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:13,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:13,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:13,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:13,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2018-11-07 22:12:13,707 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:13,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:12:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:12:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:12:13,708 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 19 states. [2018-11-07 22:12:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:14,452 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-11-07 22:12:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:12:14,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-07 22:12:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:14,454 INFO L225 Difference]: With dead ends: 175 [2018-11-07 22:12:14,454 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 22:12:14,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:12:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 22:12:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 66. [2018-11-07 22:12:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 22:12:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-11-07 22:12:14,468 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 49 [2018-11-07 22:12:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:14,469 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-07 22:12:14,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:12:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-07 22:12:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 22:12:14,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:14,470 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:14,470 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:14,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash -396473339, now seen corresponding path program 6 times [2018-11-07 22:12:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:12:14,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:14,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:14,665 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:14,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:12:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:14,665 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:12:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:14,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:14,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:14,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:14,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:14,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:14,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:14,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-07 22:12:14,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:14,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:12:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:12:14,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:12:14,789 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 12 states. [2018-11-07 22:12:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:14,943 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-07 22:12:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:12:14,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-07 22:12:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:14,945 INFO L225 Difference]: With dead ends: 76 [2018-11-07 22:12:14,945 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 22:12:14,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 22:12:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-07 22:12:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 22:12:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-07 22:12:14,964 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-07 22:12:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:14,964 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-07 22:12:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:12:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-07 22:12:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:12:14,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:14,965 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:14,965 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:14,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash 928978729, now seen corresponding path program 7 times [2018-11-07 22:12:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:14,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:15,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:15,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:15,265 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:15,265 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:15,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:15,265 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:12:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:15,273 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:15,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:15,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:15,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 26 [2018-11-07 22:12:15,774 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:15,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:12:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:12:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:15,775 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 26 states. [2018-11-07 22:12:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:16,091 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-07 22:12:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:12:16,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-07 22:12:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:16,095 INFO L225 Difference]: With dead ends: 133 [2018-11-07 22:12:16,095 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 22:12:16,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:12:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 22:12:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-11-07 22:12:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 22:12:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 22:12:16,113 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 22:12:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:16,113 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 22:12:16,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:12:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 22:12:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:12:16,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:16,115 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:16,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:16,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash 277511861, now seen corresponding path program 4 times [2018-11-07 22:12:16,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:16,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:16,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:16,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:16,307 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:16,307 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,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,307 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:12:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:16,315 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:16,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:16,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:16,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 25 [2018-11-07 22:12:16,629 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:16,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:12:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:12:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:12:16,631 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 25 states. [2018-11-07 22:12:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:17,359 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-11-07 22:12:17,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:12:17,359 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-07 22:12:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:17,360 INFO L225 Difference]: With dead ends: 161 [2018-11-07 22:12:17,360 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 22:12:17,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:12:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 22:12:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76. [2018-11-07 22:12:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 22:12:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 22:12:17,378 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 22:12:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:17,378 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 22:12:17,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:12:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 22:12:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:12:17,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:17,379 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:17,379 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:17,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -129869503, now seen corresponding path program 5 times [2018-11-07 22:12:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:18,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:18,090 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:18,090 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:18,090 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:18,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:18,090 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:12:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:18,099 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:18,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:12:18,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:18,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:18,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2018-11-07 22:12:18,390 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:18,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:12:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:12:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:12:18,391 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 24 states. [2018-11-07 22:12:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:18,852 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-11-07 22:12:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:12:18,852 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-07 22:12:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:18,853 INFO L225 Difference]: With dead ends: 187 [2018-11-07 22:12:18,853 INFO L226 Difference]: Without dead ends: 158 [2018-11-07 22:12:18,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:12:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-07 22:12:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 76. [2018-11-07 22:12:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 22:12:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 22:12:18,873 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 22:12:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:18,874 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 22:12:18,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:12:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 22:12:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:12:18,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:18,875 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:18,875 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:18,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash -49846579, now seen corresponding path program 6 times [2018-11-07 22:12:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:19,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:19,009 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:19,009 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:19,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:19,009 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:12:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:19,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:19,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:19,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:19,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:19,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:19,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:19,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-07 22:12:19,329 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:19,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:12:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:12:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:12:19,330 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2018-11-07 22:12:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:19,801 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2018-11-07 22:12:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:12:19,801 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-11-07 22:12:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:19,802 INFO L225 Difference]: With dead ends: 211 [2018-11-07 22:12:19,803 INFO L226 Difference]: Without dead ends: 182 [2018-11-07 22:12:19,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:12:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-07 22:12:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 76. [2018-11-07 22:12:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 22:12:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 22:12:19,823 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 22:12:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:19,824 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 22:12:19,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:12:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 22:12:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:12:19,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:19,825 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:19,825 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:19,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1451911001, now seen corresponding path program 4 times [2018-11-07 22:12:19,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:19,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:19,955 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:19,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:19,956 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:19,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:19,956 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:12:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:19,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:20,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:20,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:20,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-11-07 22:12:20,306 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:20,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:12:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:12:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:12:20,307 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 22 states. [2018-11-07 22:12:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:20,869 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2018-11-07 22:12:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:12:20,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-11-07 22:12:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:20,871 INFO L225 Difference]: With dead ends: 238 [2018-11-07 22:12:20,871 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 22:12:20,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:12:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 22:12:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 79. [2018-11-07 22:12:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 22:12:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-07 22:12:20,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 59 [2018-11-07 22:12:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:20,897 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-07 22:12:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:12:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-07 22:12:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 22:12:20,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:20,897 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:20,898 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:20,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1954413347, now seen corresponding path program 8 times [2018-11-07 22:12:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:12:20,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:20,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:20,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:20,996 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:20,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:20,996 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:12:21,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:21,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:21,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:12:21,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:21,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:21,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:12:21,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:21,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-07 22:12:21,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:21,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:12:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:12:21,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:12:21,144 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 13 states. [2018-11-07 22:12:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:21,282 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-11-07 22:12:21,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:12:21,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-07 22:12:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:21,284 INFO L225 Difference]: With dead ends: 89 [2018-11-07 22:12:21,284 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 22:12:21,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:12:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 22:12:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-07 22:12:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:12:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-07 22:12:21,308 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 61 [2018-11-07 22:12:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:21,309 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-07 22:12:21,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:12:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-07 22:12:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:21,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:21,310 INFO L375 BasicCegarLoop]: trace histogram [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:12:21,310 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:21,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1550108743, now seen corresponding path program 9 times [2018-11-07 22:12:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:21,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:21,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:21,594 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:21,594 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:21,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:21,594 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:12:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:21,603 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:21,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:21,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:21,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:22,142 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 22:12:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:22,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:22,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:22,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2018-11-07 22:12:22,369 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:22,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:12:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:12:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:12:22,371 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 30 states. [2018-11-07 22:12:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:22,793 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-11-07 22:12:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:12:22,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-11-07 22:12:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:22,797 INFO L225 Difference]: With dead ends: 156 [2018-11-07 22:12:22,797 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 22:12:22,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:12:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 22:12:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-11-07 22:12:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:12:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 22:12:22,820 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 22:12:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:22,821 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 22:12:22,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:12:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 22:12:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:22,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:22,822 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:22,822 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:22,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1825386707, now seen corresponding path program 7 times [2018-11-07 22:12:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:22,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:22,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:23,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:23,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:23,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:23,019 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,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:23,019 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:12:23,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:23,028 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:23,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:23,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:23,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:23,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 29 [2018-11-07 22:12:23,769 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:12:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:12:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:12:23,770 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 29 states. [2018-11-07 22:12:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:24,288 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-07 22:12:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:12:24,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-11-07 22:12:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:24,290 INFO L225 Difference]: With dead ends: 190 [2018-11-07 22:12:24,290 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 22:12:24,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:12:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 22:12:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 89. [2018-11-07 22:12:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:12:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 22:12:24,318 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 22:12:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 22:12:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:12:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 22:12:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:24,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:24,319 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:24,319 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:24,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:24,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1995551649, now seen corresponding path program 8 times [2018-11-07 22:12:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:24,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:24,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:24,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:24,475 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:24,475 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:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:24,475 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:12:24,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:24,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:24,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:12:24,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:24,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:24,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:24,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:24,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2018-11-07 22:12:24,888 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:12:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:12:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:12:24,890 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 28 states. [2018-11-07 22:12:25,568 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 22:12:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:25,865 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-11-07 22:12:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:12:25,865 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-11-07 22:12:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:25,866 INFO L225 Difference]: With dead ends: 222 [2018-11-07 22:12:25,866 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 22:12:25,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 114 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:12:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 22:12:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 89. [2018-11-07 22:12:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:12:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 22:12:25,896 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 22:12:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:25,896 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 22:12:25,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:12:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 22:12:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:25,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:25,897 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:25,897 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:25,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash 632871659, now seen corresponding path program 9 times [2018-11-07 22:12:25,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:25,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:25,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:26,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:26,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:26,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:26,049 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:26,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:26,049 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:12:26,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:26,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:26,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:26,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:26,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:26,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:26,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:26,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-07 22:12:26,408 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:26,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:12:26,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:12:26,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:12:26,409 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 27 states. [2018-11-07 22:12:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:27,467 INFO L93 Difference]: Finished difference Result 252 states and 293 transitions. [2018-11-07 22:12:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:12:27,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-11-07 22:12:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:27,469 INFO L225 Difference]: With dead ends: 252 [2018-11-07 22:12:27,469 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 22:12:27,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 115 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:12:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 22:12:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 89. [2018-11-07 22:12:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:12:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 22:12:27,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 22:12:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:27,507 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 22:12:27,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:12:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 22:12:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:27,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:27,508 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:27,508 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:27,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 613260407, now seen corresponding path program 10 times [2018-11-07 22:12:27,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:27,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:27,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:27,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:27,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:12:27,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:27,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 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:12:27,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:27,736 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:27,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:27,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:28,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2018-11-07 22:12:28,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:12:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:12:28,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:28,083 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 26 states. [2018-11-07 22:12:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:28,659 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2018-11-07 22:12:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:12:28,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-11-07 22:12:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:28,662 INFO L225 Difference]: With dead ends: 280 [2018-11-07 22:12:28,662 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 22:12:28,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 116 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:12:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 22:12:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 89. [2018-11-07 22:12:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:12:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 22:12:28,701 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 22:12:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:28,702 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 22:12:28,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:12:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 22:12:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:28,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:28,703 INFO L375 BasicCegarLoop]: trace histogram [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:12:28,703 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1618825475, now seen corresponding path program 5 times [2018-11-07 22:12:28,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:28,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:28,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:28,897 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:28,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:12:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:28,898 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:12:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:28,914 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:28,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:12:28,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:28,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:29,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:29,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-11-07 22:12:29,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:12:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:12:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:12:29,252 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 25 states. [2018-11-07 22:12:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:29,931 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2018-11-07 22:12:29,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:12:29,931 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2018-11-07 22:12:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:29,933 INFO L225 Difference]: With dead ends: 311 [2018-11-07 22:12:29,933 INFO L226 Difference]: Without dead ends: 278 [2018-11-07 22:12:29,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:12:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-07 22:12:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 92. [2018-11-07 22:12:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 22:12:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-07 22:12:29,984 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 69 [2018-11-07 22:12:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:29,984 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-07 22:12:29,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:12:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-07 22:12:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 22:12:29,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:29,985 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:29,985 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:29,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470529, now seen corresponding path program 10 times [2018-11-07 22:12:29,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:29,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:29,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:12:30,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:30,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:30,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:30,482 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:30,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:30,482 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:12:30,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:30,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:30,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:30,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:12:31,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-07 22:12:31,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:31,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:12:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:12:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:31,134 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 14 states. [2018-11-07 22:12:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:31,293 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-07 22:12:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:12:31,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-07 22:12:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:31,296 INFO L225 Difference]: With dead ends: 102 [2018-11-07 22:12:31,296 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 22:12:31,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 135 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:12:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 22:12:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-07 22:12:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 22:12:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-07 22:12:31,337 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 71 [2018-11-07 22:12:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:31,338 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-07 22:12:31,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:12:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-07 22:12:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:31,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:31,339 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:31,339 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:31,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 58575589, now seen corresponding path program 11 times [2018-11-07 22:12:31,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:31,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:31,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:31,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:31,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:31,575 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,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,575 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:12:31,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:31,584 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:31,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:12:31,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:31,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:31,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:32,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 34 [2018-11-07 22:12:32,043 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:32,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:12:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:12:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:12:32,044 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 34 states. [2018-11-07 22:12:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:32,835 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2018-11-07 22:12:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:12:32,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-11-07 22:12:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:32,837 INFO L225 Difference]: With dead ends: 179 [2018-11-07 22:12:32,837 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 22:12:32,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:12:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 22:12:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2018-11-07 22:12:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:32,873 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:12:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:32,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:32,875 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:32,875 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:32,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 127267953, now seen corresponding path program 11 times [2018-11-07 22:12:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:32,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:32,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:33,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:33,336 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:33,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:33,336 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:33,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:33,336 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:12:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:33,346 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:33,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:12:33,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:33,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:33,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:33,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:33,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 33 [2018-11-07 22:12:33,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:33,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:12:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:12:33,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:12:33,812 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 33 states. [2018-11-07 22:12:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:34,569 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2018-11-07 22:12:34,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:12:34,570 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-11-07 22:12:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:34,571 INFO L225 Difference]: With dead ends: 219 [2018-11-07 22:12:34,571 INFO L226 Difference]: Without dead ends: 182 [2018-11-07 22:12:34,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 129 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:12:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-07 22:12:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2018-11-07 22:12:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:34,609 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:34,609 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:34,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:12:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:34,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:34,610 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:34,610 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:34,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 310579453, now seen corresponding path program 12 times [2018-11-07 22:12:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:34,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:34,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:35,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:35,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:35,472 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:35,472 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:35,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:35,472 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:12:35,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:35,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:35,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:35,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:35,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:35,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:36,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:36,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 32 [2018-11-07 22:12:36,235 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:36,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:12:36,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:12:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:12:36,237 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 32 states. [2018-11-07 22:12:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:37,487 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-11-07 22:12:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:12:37,488 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 79 [2018-11-07 22:12:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:37,489 INFO L225 Difference]: With dead ends: 257 [2018-11-07 22:12:37,489 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 22:12:37,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 130 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:12:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 22:12:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 102. [2018-11-07 22:12:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:37,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:37,560 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:37,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:12:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:37,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:37,561 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:37,561 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:37,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:37,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1427775351, now seen corresponding path program 13 times [2018-11-07 22:12:37,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:37,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:37,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:38,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:38,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:38,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:38,873 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:38,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:38,873 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:12:38,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:38,883 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:38,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:39,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:39,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:39,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2018-11-07 22:12:39,292 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:39,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:12:39,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:12:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:12:39,293 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 31 states. [2018-11-07 22:12:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:40,066 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2018-11-07 22:12:40,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:12:40,066 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-11-07 22:12:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:40,068 INFO L225 Difference]: With dead ends: 293 [2018-11-07 22:12:40,068 INFO L226 Difference]: Without dead ends: 256 [2018-11-07 22:12:40,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 131 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:12:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-07 22:12:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 102. [2018-11-07 22:12:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:40,110 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:40,110 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:40,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:12:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:40,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:40,111 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:40,111 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:40,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash 143598357, now seen corresponding path program 14 times [2018-11-07 22:12:40,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:40,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:40,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:40,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:40,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:40,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:40,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:40,490 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:40,490 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:40,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:40,490 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:12:40,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:40,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:40,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:12:40,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:40,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:40,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:41,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:41,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2018-11-07 22:12:41,185 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:12:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:12:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:12:41,186 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 30 states. [2018-11-07 22:12:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:41,999 INFO L93 Difference]: Finished difference Result 327 states and 382 transitions. [2018-11-07 22:12:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:12:41,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-11-07 22:12:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:42,001 INFO L225 Difference]: With dead ends: 327 [2018-11-07 22:12:42,001 INFO L226 Difference]: Without dead ends: 290 [2018-11-07 22:12:42,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:12:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-07 22:12:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 102. [2018-11-07 22:12:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:42,057 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:42,057 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:42,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:12:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:42,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:42,058 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:42,059 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:42,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1602250591, now seen corresponding path program 15 times [2018-11-07 22:12:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:42,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:42,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:42,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:42,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:42,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:42,304 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:42,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:42,304 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:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:42,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:42,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:42,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:42,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:42,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:42,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2018-11-07 22:12:42,685 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:42,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:12:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:12:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:12:42,686 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 29 states. [2018-11-07 22:12:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:44,021 INFO L93 Difference]: Finished difference Result 359 states and 422 transitions. [2018-11-07 22:12:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:12:44,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-11-07 22:12:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:44,023 INFO L225 Difference]: With dead ends: 359 [2018-11-07 22:12:44,024 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 22:12:44,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 133 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:12:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 22:12:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 102. [2018-11-07 22:12:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:12:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:12:44,093 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 22:12:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:44,093 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:12:44,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:12:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:12:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:12:44,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:44,094 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:44,095 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:44,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1326972627, now seen corresponding path program 6 times [2018-11-07 22:12:44,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:44,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:44,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:44,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:44,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:45,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:45,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:45,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:45,425 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:45,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:45,425 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:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:45,434 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:45,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:45,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:45,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:45,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:45,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-11-07 22:12:45,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:45,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:12:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:12:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:12:45,772 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 28 states. [2018-11-07 22:12:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:46,690 INFO L93 Difference]: Finished difference Result 394 states and 466 transitions. [2018-11-07 22:12:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:12:46,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-11-07 22:12:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:46,692 INFO L225 Difference]: With dead ends: 394 [2018-11-07 22:12:46,692 INFO L226 Difference]: Without dead ends: 357 [2018-11-07 22:12:46,693 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 134 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:12:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-07 22:12:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 105. [2018-11-07 22:12:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 22:12:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-07 22:12:46,749 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-11-07 22:12:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:46,749 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-07 22:12:46,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:12:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-07 22:12:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 22:12:46,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:46,750 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:46,750 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:46,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1957490143, now seen corresponding path program 12 times [2018-11-07 22:12:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:46,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:46,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:12:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:47,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:47,024 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,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,024 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:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:47,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:47,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:47,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:47,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:47,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:12:47,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:47,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-07 22:12:47,258 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:47,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:12:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:12:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:12:47,259 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 15 states. [2018-11-07 22:12:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:47,510 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-07 22:12:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:12:47,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-11-07 22:12:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:47,512 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:12:47,512 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 22:12:47,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 154 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:12:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 22:12:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-07 22:12:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 22:12:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-11-07 22:12:47,566 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 81 [2018-11-07 22:12:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:47,566 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-07 22:12:47,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:12:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-11-07 22:12:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:47,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:47,568 INFO L375 BasicCegarLoop]: trace histogram [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:12:47,568 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:47,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash -507298045, now seen corresponding path program 13 times [2018-11-07 22:12:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:47,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:47,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:47,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,844 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:47,844 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:47,844 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,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:47,844 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:47,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:47,854 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:47,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:48,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:48,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:48,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 38 [2018-11-07 22:12:48,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:48,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:12:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:12:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:12:48,435 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 38 states. [2018-11-07 22:12:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:49,122 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-11-07 22:12:49,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:12:49,123 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 89 [2018-11-07 22:12:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:49,124 INFO L225 Difference]: With dead ends: 202 [2018-11-07 22:12:49,124 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 22:12:49,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:12:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 22:12:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 115. [2018-11-07 22:12:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:12:49,183 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:12:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:49,183 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:12:49,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:12:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:12:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:49,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:49,184 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:49,184 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:49,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1248990833, now seen corresponding path program 16 times [2018-11-07 22:12:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:49,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:49,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:49,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:49,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:49,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:49,448 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:49,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:49,448 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:49,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:49,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:49,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:49,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:49,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:49,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 37 [2018-11-07 22:12:49,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:49,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:12:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:12:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:12:49,972 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 37 states. [2018-11-07 22:12:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:50,904 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2018-11-07 22:12:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:12:50,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-11-07 22:12:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:50,905 INFO L225 Difference]: With dead ends: 248 [2018-11-07 22:12:50,905 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 22:12:50,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 145 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:12:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 22:12:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 115. [2018-11-07 22:12:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:12:50,980 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:12:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:50,980 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:12:50,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:12:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:12:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:50,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:50,981 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:50,981 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:50,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash 752469787, now seen corresponding path program 17 times [2018-11-07 22:12:50,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:50,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:50,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:51,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:51,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:51,744 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:51,744 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:51,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:51,744 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:51,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:51,754 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:51,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:12:51,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:51,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:52,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 36 [2018-11-07 22:12:52,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:12:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:12:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:12:52,616 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 36 states. [2018-11-07 22:12:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:53,539 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2018-11-07 22:12:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:12:53,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-11-07 22:12:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:53,541 INFO L225 Difference]: With dead ends: 292 [2018-11-07 22:12:53,541 INFO L226 Difference]: Without dead ends: 251 [2018-11-07 22:12:53,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 146 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:12:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-07 22:12:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 115. [2018-11-07 22:12:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:12:53,631 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:12:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:53,632 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:12:53,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:12:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:12:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:53,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:53,632 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:53,632 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:53,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1940416601, now seen corresponding path program 18 times [2018-11-07 22:12:53,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:53,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:53,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:53,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:53,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:53,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:53,848 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,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:53,848 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:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:53,858 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:53,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:53,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:53,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:54,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 35 [2018-11-07 22:12:54,526 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:54,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:12:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:12:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:12:54,527 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 35 states. [2018-11-07 22:12:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:55,708 INFO L93 Difference]: Finished difference Result 334 states and 387 transitions. [2018-11-07 22:12:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:12:55,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 89 [2018-11-07 22:12:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:55,709 INFO L225 Difference]: With dead ends: 334 [2018-11-07 22:12:55,709 INFO L226 Difference]: Without dead ends: 293 [2018-11-07 22:12:55,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:12:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-07 22:12:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 115. [2018-11-07 22:12:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:12:55,798 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:12:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:55,798 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:12:55,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:12:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:12:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:55,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:55,800 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:55,800 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:55,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 233315123, now seen corresponding path program 19 times [2018-11-07 22:12:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:55,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:55,801 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:56,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:56,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:56,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:56,372 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:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:56,372 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:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:56,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:56,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:56,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:56,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2018-11-07 22:12:56,930 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:56,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:12:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:12:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:12:56,931 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 34 states. [2018-11-07 22:12:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:58,028 INFO L93 Difference]: Finished difference Result 374 states and 436 transitions. [2018-11-07 22:12:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:12:58,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-11-07 22:12:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:58,030 INFO L225 Difference]: With dead ends: 374 [2018-11-07 22:12:58,030 INFO L226 Difference]: Without dead ends: 333 [2018-11-07 22:12:58,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:12:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-07 22:12:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 115. [2018-11-07 22:12:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:12:58,135 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:12:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:58,135 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:12:58,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:12:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:12:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:12:58,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:58,137 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:58,137 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:58,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1822167487, now seen corresponding path program 20 times [2018-11-07 22:12:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:58,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:58,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:58,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:58,570 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:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:58,570 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:58,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:58,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:58,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:12:58,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:58,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:58,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:59,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:59,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-07 22:12:59,085 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:59,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:12:59,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:12:59,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:12:59,086 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 33 states. [2018-11-07 22:13:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:00,193 INFO L93 Difference]: Finished difference Result 412 states and 483 transitions. [2018-11-07 22:13:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:13:00,194 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-07 22:13:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:00,195 INFO L225 Difference]: With dead ends: 412 [2018-11-07 22:13:00,196 INFO L226 Difference]: Without dead ends: 371 [2018-11-07 22:13:00,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 149 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:13:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-07 22:13:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 115. [2018-11-07 22:13:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:13:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:13:00,290 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:13:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:00,291 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:13:00,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:13:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:13:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:13:00,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:00,292 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:00,292 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:00,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1890859851, now seen corresponding path program 21 times [2018-11-07 22:13:00,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:00,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:00,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:00,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:00,987 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:00,987 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:00,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:00,987 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:13:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:01,013 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:01,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:01,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:01,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:01,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2018-11-07 22:13:01,966 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:01,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:13:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:13:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:13:01,967 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 32 states. [2018-11-07 22:13:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:03,406 INFO L93 Difference]: Finished difference Result 448 states and 528 transitions. [2018-11-07 22:13:03,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:13:03,407 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2018-11-07 22:13:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:03,408 INFO L225 Difference]: With dead ends: 448 [2018-11-07 22:13:03,408 INFO L226 Difference]: Without dead ends: 407 [2018-11-07 22:13:03,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 150 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:13:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-07 22:13:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 115. [2018-11-07 22:13:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:13:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 22:13:03,497 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 22:13:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:03,498 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 22:13:03,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:13:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 22:13:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:13:03,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:03,499 INFO L375 BasicCegarLoop]: trace histogram [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:13:03,499 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:03,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2074171351, now seen corresponding path program 7 times [2018-11-07 22:13:03,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:03,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:03,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:04,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:04,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:04,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:04,049 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:04,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:04,049 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:13:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:04,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:04,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:04,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-11-07 22:13:04,477 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:04,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:13:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:13:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:13:04,478 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 31 states. [2018-11-07 22:13:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:05,844 INFO L93 Difference]: Finished difference Result 487 states and 577 transitions. [2018-11-07 22:13:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:13:05,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-07 22:13:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:05,846 INFO L225 Difference]: With dead ends: 487 [2018-11-07 22:13:05,846 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 22:13:05,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 151 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:13:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 22:13:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 118. [2018-11-07 22:13:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 22:13:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-11-07 22:13:05,947 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 89 [2018-11-07 22:13:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:05,947 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-11-07 22:13:05,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:13:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-11-07 22:13:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 22:13:05,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:05,948 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:05,948 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:05,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1421446787, now seen corresponding path program 14 times [2018-11-07 22:13:05,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:05,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:05,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:05,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:05,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:13:06,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:06,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:06,089 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:06,089 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:06,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:06,089 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:13:06,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:06,098 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:06,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:13:06,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:06,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:06,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:06,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:06,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-07 22:13:06,410 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:06,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:13:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:13:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:13:06,411 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 16 states. [2018-11-07 22:13:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:06,777 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-11-07 22:13:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:13:06,777 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-07 22:13:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:06,779 INFO L225 Difference]: With dead ends: 128 [2018-11-07 22:13:06,779 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 22:13:06,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 173 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:13:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 22:13:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 22:13:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 22:13:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-07 22:13:06,887 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 91 [2018-11-07 22:13:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:06,888 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-07 22:13:06,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:13:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-07 22:13:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:06,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:06,889 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:06,889 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:06,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -161069919, now seen corresponding path program 15 times [2018-11-07 22:13:06,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:06,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:06,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:06,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:06,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:07,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:07,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:07,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:07,163 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:07,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:07,163 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:13:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:07,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:07,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:07,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:07,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:08,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:08,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:08,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 42 [2018-11-07 22:13:08,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:08,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:13:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:13:08,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:13:08,552 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 42 states. [2018-11-07 22:13:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:09,280 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-07 22:13:09,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:13:09,280 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 99 [2018-11-07 22:13:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:09,281 INFO L225 Difference]: With dead ends: 225 [2018-11-07 22:13:09,281 INFO L226 Difference]: Without dead ends: 180 [2018-11-07 22:13:09,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:13:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-07 22:13:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 128. [2018-11-07 22:13:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:09,414 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:09,414 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:09,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:13:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:09,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:09,415 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:09,416 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:09,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1635135533, now seen corresponding path program 22 times [2018-11-07 22:13:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:09,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:09,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:09,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:09,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:09,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:09,805 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:09,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:09,806 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:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:09,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:09,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:10,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 41 [2018-11-07 22:13:10,369 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:10,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:13:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:13:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:13:10,370 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 41 states. [2018-11-07 22:13:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:11,419 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-11-07 22:13:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:13:11,420 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-11-07 22:13:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:11,421 INFO L225 Difference]: With dead ends: 277 [2018-11-07 22:13:11,421 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 22:13:11,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 161 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:13:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 22:13:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 128. [2018-11-07 22:13:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:11,518 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:11,519 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:11,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:13:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:11,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:11,520 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:11,521 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1382256313, now seen corresponding path program 23 times [2018-11-07 22:13:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:11,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:11,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:11,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:11,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:11,969 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:11,970 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:11,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:11,970 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:11,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:11,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:12,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:13:12,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:12,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:13,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 40 [2018-11-07 22:13:13,823 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:13,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:13:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:13:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:13:13,824 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 40 states. [2018-11-07 22:13:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:15,089 INFO L93 Difference]: Finished difference Result 327 states and 376 transitions. [2018-11-07 22:13:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:13:15,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 99 [2018-11-07 22:13:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:15,090 INFO L225 Difference]: With dead ends: 327 [2018-11-07 22:13:15,090 INFO L226 Difference]: Without dead ends: 282 [2018-11-07 22:13:15,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 162 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:13:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-07 22:13:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 128. [2018-11-07 22:13:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:15,194 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:15,194 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:15,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:13:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:15,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:15,195 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:15,195 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:15,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2012160069, now seen corresponding path program 24 times [2018-11-07 22:13:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:15,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:15,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:15,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:15,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:15,480 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:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:15,480 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:15,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:15,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:15,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:15,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:15,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:15,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:16,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2018-11-07 22:13:16,009 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:16,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:13:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:13:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:13:16,010 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 39 states. [2018-11-07 22:13:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:17,577 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2018-11-07 22:13:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:13:17,578 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 99 [2018-11-07 22:13:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:17,579 INFO L225 Difference]: With dead ends: 375 [2018-11-07 22:13:17,579 INFO L226 Difference]: Without dead ends: 330 [2018-11-07 22:13:17,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 163 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:13:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-07 22:13:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 128. [2018-11-07 22:13:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:17,702 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:17,702 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:17,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:13:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:17,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:17,703 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:17,703 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:17,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1173773103, now seen corresponding path program 25 times [2018-11-07 22:13:17,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:17,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:17,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:18,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:18,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:18,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:18,048 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:18,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:18,048 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:18,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:18,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:18,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:18,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:18,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 38 [2018-11-07 22:13:18,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:18,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:13:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:13:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:13:18,691 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 38 states. [2018-11-07 22:13:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:20,294 INFO L93 Difference]: Finished difference Result 421 states and 490 transitions. [2018-11-07 22:13:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:13:20,294 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-11-07 22:13:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:20,296 INFO L225 Difference]: With dead ends: 421 [2018-11-07 22:13:20,296 INFO L226 Difference]: Without dead ends: 376 [2018-11-07 22:13:20,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 164 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 22:13:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-07 22:13:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 128. [2018-11-07 22:13:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:20,497 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:20,497 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:20,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:13:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:20,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:20,498 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:20,499 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:20,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash -975971235, now seen corresponding path program 26 times [2018-11-07 22:13:20,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:20,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:20,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:20,843 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:20,843 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,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:20,844 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:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:20,856 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:20,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:13:20,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:20,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:21,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:21,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:21,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2018-11-07 22:13:21,412 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:21,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:13:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:13:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:13:21,413 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 37 states. [2018-11-07 22:13:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:23,142 INFO L93 Difference]: Finished difference Result 465 states and 544 transitions. [2018-11-07 22:13:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:13:23,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2018-11-07 22:13:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:23,145 INFO L225 Difference]: With dead ends: 465 [2018-11-07 22:13:23,145 INFO L226 Difference]: Without dead ends: 420 [2018-11-07 22:13:23,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 165 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:13:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-07 22:13:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 128. [2018-11-07 22:13:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:23,264 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:23,264 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:13:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:23,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:23,265 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:23,265 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:23,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1717664023, now seen corresponding path program 27 times [2018-11-07 22:13:23,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:23,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:23,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:23,574 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:23,574 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,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:23,583 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:23,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:23,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:23,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:23,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:24,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:24,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2018-11-07 22:13:24,113 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:24,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:13:24,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:13:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:13:24,114 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 36 states. [2018-11-07 22:13:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:25,849 INFO L93 Difference]: Finished difference Result 507 states and 596 transitions. [2018-11-07 22:13:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:13:25,849 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-07 22:13:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:25,851 INFO L225 Difference]: With dead ends: 507 [2018-11-07 22:13:25,851 INFO L226 Difference]: Without dead ends: 462 [2018-11-07 22:13:25,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 166 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:13:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-07 22:13:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 128. [2018-11-07 22:13:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:25,986 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:25,986 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:25,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:13:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:25,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:25,987 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:25,987 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 283796597, now seen corresponding path program 28 times [2018-11-07 22:13:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:26,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:26,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:26,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:26,484 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:26,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:26,484 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:26,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:26,495 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:26,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:27,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 35 [2018-11-07 22:13:27,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:27,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:13:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:13:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:13:27,470 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 35 states. [2018-11-07 22:13:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:29,218 INFO L93 Difference]: Finished difference Result 547 states and 646 transitions. [2018-11-07 22:13:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:13:29,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-11-07 22:13:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:29,220 INFO L225 Difference]: With dead ends: 547 [2018-11-07 22:13:29,220 INFO L226 Difference]: Without dead ends: 502 [2018-11-07 22:13:29,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:13:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-11-07 22:13:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 128. [2018-11-07 22:13:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 22:13:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 22:13:29,407 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 22:13:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:29,407 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 22:13:29,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:13:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 22:13:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:13:29,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:29,408 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:29,408 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:29,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1885877505, now seen corresponding path program 8 times [2018-11-07 22:13:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:29,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:29,675 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:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,676 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:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:29,685 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:29,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:13:29,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:29,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:29,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:30,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:30,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2018-11-07 22:13:30,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:30,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:13:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:13:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:13:30,172 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 34 states. [2018-11-07 22:13:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:31,999 INFO L93 Difference]: Finished difference Result 590 states and 700 transitions. [2018-11-07 22:13:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:13:31,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-11-07 22:13:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:32,002 INFO L225 Difference]: With dead ends: 590 [2018-11-07 22:13:32,002 INFO L226 Difference]: Without dead ends: 545 [2018-11-07 22:13:32,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:13:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-11-07 22:13:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 131. [2018-11-07 22:13:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 22:13:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-11-07 22:13:32,145 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 99 [2018-11-07 22:13:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:32,145 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-11-07 22:13:32,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:13:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-11-07 22:13:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 22:13:32,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:32,147 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:32,147 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:32,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1743772005, now seen corresponding path program 16 times [2018-11-07 22:13:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:32,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:32,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:13:32,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:32,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:32,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:32,370 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:32,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:32,370 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:13:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:32,379 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:32,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:32,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:13:32,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-07 22:13:32,611 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:32,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:13:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:13:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:13:32,612 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 17 states. [2018-11-07 22:13:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:32,945 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-07 22:13:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:13:32,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-07 22:13:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:32,947 INFO L225 Difference]: With dead ends: 141 [2018-11-07 22:13:32,947 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 22:13:32,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:13:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 22:13:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-07 22:13:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-07 22:13:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2018-11-07 22:13:33,078 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 101 [2018-11-07 22:13:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:33,078 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-11-07 22:13:33,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:13:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2018-11-07 22:13:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:33,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:33,079 INFO L375 BasicCegarLoop]: trace histogram [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:13:33,079 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:33,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -860881985, now seen corresponding path program 17 times [2018-11-07 22:13:33,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:33,080 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:33,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:33,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:33,419 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:33,419 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:33,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:33,419 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:13:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:33,428 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:33,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:13:33,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:33,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:33,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:34,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2018-11-07 22:13:34,105 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:13:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:13:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:13:34,106 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 46 states. [2018-11-07 22:13:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:34,963 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-11-07 22:13:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:13:34,963 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-11-07 22:13:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:34,964 INFO L225 Difference]: With dead ends: 248 [2018-11-07 22:13:34,964 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 22:13:34,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:13:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 22:13:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2018-11-07 22:13:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:35,113 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:35,113 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:13:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:35,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:35,114 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:35,114 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:35,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1311238219, now seen corresponding path program 29 times [2018-11-07 22:13:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:35,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:35,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:35,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:35,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:35,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:35,482 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:35,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:35,482 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:13:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:35,494 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:35,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:13:35,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:35,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:35,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:36,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:36,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2018-11-07 22:13:36,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:36,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:13:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:13:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:13:36,198 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 45 states. [2018-11-07 22:13:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:37,650 INFO L93 Difference]: Finished difference Result 306 states and 349 transitions. [2018-11-07 22:13:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:13:37,650 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 109 [2018-11-07 22:13:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:37,651 INFO L225 Difference]: With dead ends: 306 [2018-11-07 22:13:37,651 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 22:13:37,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 177 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 22:13:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 22:13:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2018-11-07 22:13:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:37,807 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:37,807 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:37,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:13:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:37,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:37,808 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:37,808 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:37,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 562661335, now seen corresponding path program 30 times [2018-11-07 22:13:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:37,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:37,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:39,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:39,519 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:39,519 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,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,520 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:13:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:39,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:39,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:39,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:39,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:39,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:40,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:40,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 44 [2018-11-07 22:13:40,231 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:40,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:13:40,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:13:40,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:13:40,232 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 44 states. [2018-11-07 22:13:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:41,905 INFO L93 Difference]: Finished difference Result 362 states and 416 transitions. [2018-11-07 22:13:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:13:41,905 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2018-11-07 22:13:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:41,906 INFO L225 Difference]: With dead ends: 362 [2018-11-07 22:13:41,906 INFO L226 Difference]: Without dead ends: 313 [2018-11-07 22:13:41,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 178 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:13:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-07 22:13:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 141. [2018-11-07 22:13:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:42,100 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:42,101 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:42,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:13:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:42,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:42,102 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:42,102 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 195402339, now seen corresponding path program 31 times [2018-11-07 22:13:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:42,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:42,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:42,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:42,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:42,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:13:42,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:42,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 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:13:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:42,965 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:42,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:43,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:43,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 43 [2018-11-07 22:13:43,681 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:43,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:13:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:13:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:13:43,682 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 43 states. [2018-11-07 22:13:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:45,572 INFO L93 Difference]: Finished difference Result 416 states and 481 transitions. [2018-11-07 22:13:45,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:13:45,573 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-11-07 22:13:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:45,574 INFO L225 Difference]: With dead ends: 416 [2018-11-07 22:13:45,574 INFO L226 Difference]: Without dead ends: 367 [2018-11-07 22:13:45,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 22:13:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-07 22:13:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 141. [2018-11-07 22:13:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:45,723 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:45,723 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:45,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:13:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:45,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:45,724 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:45,725 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:45,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1316806639, now seen corresponding path program 32 times [2018-11-07 22:13:45,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:45,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:45,726 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:47,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:47,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:47,233 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:47,233 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:47,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:47,234 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:47,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:47,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:13:47,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:47,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:47,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:48,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:48,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 42 [2018-11-07 22:13:48,115 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:48,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:13:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:13:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:13:48,116 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 42 states. [2018-11-07 22:13:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:50,145 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-11-07 22:13:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 22:13:50,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 109 [2018-11-07 22:13:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:50,147 INFO L225 Difference]: With dead ends: 468 [2018-11-07 22:13:50,147 INFO L226 Difference]: Without dead ends: 419 [2018-11-07 22:13:50,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 22:13:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-07 22:13:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 141. [2018-11-07 22:13:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:50,315 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:50,315 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:50,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:13:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:50,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:50,317 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:50,317 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:50,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash 893393019, now seen corresponding path program 33 times [2018-11-07 22:13:50,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:50,588 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:50,588 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:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,588 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:50,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:50,596 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:50,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:50,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:50,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:51,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 41 [2018-11-07 22:13:51,589 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:51,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:13:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:13:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:13:51,591 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 41 states. [2018-11-07 22:13:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:54,442 INFO L93 Difference]: Finished difference Result 518 states and 605 transitions. [2018-11-07 22:13:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:13:54,443 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-11-07 22:13:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:54,445 INFO L225 Difference]: With dead ends: 518 [2018-11-07 22:13:54,445 INFO L226 Difference]: Without dead ends: 469 [2018-11-07 22:13:54,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 22:13:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-11-07 22:13:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 141. [2018-11-07 22:13:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:54,604 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:54,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:13:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:54,606 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:54,606 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:54,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1605368825, now seen corresponding path program 34 times [2018-11-07 22:13:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:54,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:54,954 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:54,954 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:54,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,954 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:54,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:54,963 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:54,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:55,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:55,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:55,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2018-11-07 22:13:55,557 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:13:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:13:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:13:55,558 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 40 states. [2018-11-07 22:13:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:58,009 INFO L93 Difference]: Finished difference Result 566 states and 664 transitions. [2018-11-07 22:13:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:13:58,009 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 109 [2018-11-07 22:13:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:58,011 INFO L225 Difference]: With dead ends: 566 [2018-11-07 22:13:58,011 INFO L226 Difference]: Without dead ends: 517 [2018-11-07 22:13:58,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 182 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 22:13:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-07 22:13:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 141. [2018-11-07 22:13:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:13:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:13:58,174 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:13:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:58,174 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:13:58,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:13:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:13:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:13:58,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:58,175 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:58,175 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:58,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1858248045, now seen corresponding path program 35 times [2018-11-07 22:13:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:59,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:59,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:59,234 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:59,234 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:59,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:59,235 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:59,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:59,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:59,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:13:59,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:59,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:59,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:13:59,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:59,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-07 22:13:59,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:59,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:13:59,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:13:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:13:59,842 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 39 states. [2018-11-07 22:14:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:02,175 INFO L93 Difference]: Finished difference Result 612 states and 721 transitions. [2018-11-07 22:14:02,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 22:14:02,175 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-11-07 22:14:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:02,178 INFO L225 Difference]: With dead ends: 612 [2018-11-07 22:14:02,178 INFO L226 Difference]: Without dead ends: 563 [2018-11-07 22:14:02,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 183 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:14:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-07 22:14:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 141. [2018-11-07 22:14:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:14:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:14:02,366 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:14:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:02,366 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:14:02,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:14:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:14:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:14:02,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:02,367 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:02,368 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:02,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1228344289, now seen corresponding path program 36 times [2018-11-07 22:14:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:02,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:02,779 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:02,780 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:02,780 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:02,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:02,780 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:02,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:02,795 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:02,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:02,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:02,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:03,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:03,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:03,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2018-11-07 22:14:03,439 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:03,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:14:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:14:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:14:03,440 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 38 states. [2018-11-07 22:14:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:05,849 INFO L93 Difference]: Finished difference Result 656 states and 776 transitions. [2018-11-07 22:14:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:14:05,849 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-11-07 22:14:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:05,851 INFO L225 Difference]: With dead ends: 656 [2018-11-07 22:14:05,852 INFO L226 Difference]: Without dead ends: 607 [2018-11-07 22:14:05,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 184 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 22:14:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-07 22:14:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 141. [2018-11-07 22:14:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:14:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:14:06,040 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 22:14:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:06,040 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:14:06,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:14:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:14:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:14:06,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:06,041 INFO L375 BasicCegarLoop]: trace histogram [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:14:06,041 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:06,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -119310165, now seen corresponding path program 9 times [2018-11-07 22:14:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:07,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:07,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:07,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:07,222 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:07,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:07,222 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:07,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:07,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:07,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:07,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:07,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:08,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:08,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-11-07 22:14:08,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:08,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:14:08,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:14:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:14:08,118 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 37 states. [2018-11-07 22:14:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:10,424 INFO L93 Difference]: Finished difference Result 703 states and 835 transitions. [2018-11-07 22:14:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:14:10,430 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2018-11-07 22:14:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:10,433 INFO L225 Difference]: With dead ends: 703 [2018-11-07 22:14:10,433 INFO L226 Difference]: Without dead ends: 654 [2018-11-07 22:14:10,434 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:14:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-11-07 22:14:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 144. [2018-11-07 22:14:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 22:14:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-11-07 22:14:10,617 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 109 [2018-11-07 22:14:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:10,617 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-11-07 22:14:10,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:14:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-11-07 22:14:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 22:14:10,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:10,618 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:10,618 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:10,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1752486599, now seen corresponding path program 18 times [2018-11-07 22:14:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:14:10,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:10,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:10,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:10,771 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:10,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:10,771 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:10,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:10,780 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:10,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:10,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:10,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:10,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 22:14:11,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:11,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-07 22:14:11,005 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:14:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:14:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:14:11,005 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 18 states. [2018-11-07 22:14:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:11,463 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-07 22:14:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:14:11,464 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-07 22:14:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:11,465 INFO L225 Difference]: With dead ends: 154 [2018-11-07 22:14:11,465 INFO L226 Difference]: Without dead ends: 152 [2018-11-07 22:14:11,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 211 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:14:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-07 22:14:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-07 22:14:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-07 22:14:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-11-07 22:14:11,657 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 111 [2018-11-07 22:14:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:11,657 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-11-07 22:14:11,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:14:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-11-07 22:14:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:11,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:11,658 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:11,658 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:11,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1040286813, now seen corresponding path program 19 times [2018-11-07 22:14:11,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:11,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:11,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:11,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:11,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:11,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:11,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:11,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:11,945 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:11,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:11,946 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:11,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:11,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:11,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:12,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:12,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:12,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 50 [2018-11-07 22:14:12,763 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:12,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:14:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:14:12,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:14:12,764 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 50 states. [2018-11-07 22:14:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:14,062 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-11-07 22:14:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:14:14,063 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2018-11-07 22:14:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:14,064 INFO L225 Difference]: With dead ends: 271 [2018-11-07 22:14:14,064 INFO L226 Difference]: Without dead ends: 218 [2018-11-07 22:14:14,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:14:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-07 22:14:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 154. [2018-11-07 22:14:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:14,276 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:14,276 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:14,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:14:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:14,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:14,277 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:14,277 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:14,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash -661376535, now seen corresponding path program 37 times [2018-11-07 22:14:14,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:14,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:14,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:14,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:14,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:14,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:14,570 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:14,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:14,570 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:14,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:14,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:14,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:15,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 49 [2018-11-07 22:14:15,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:14:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:14:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:14:15,426 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 49 states. [2018-11-07 22:14:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:17,177 INFO L93 Difference]: Finished difference Result 335 states and 382 transitions. [2018-11-07 22:14:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:14:17,177 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-11-07 22:14:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:17,179 INFO L225 Difference]: With dead ends: 335 [2018-11-07 22:14:17,179 INFO L226 Difference]: Without dead ends: 282 [2018-11-07 22:14:17,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 193 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:14:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-07 22:14:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 154. [2018-11-07 22:14:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:17,393 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:17,393 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:17,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:14:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:17,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:17,394 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:17,394 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:17,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 516739701, now seen corresponding path program 38 times [2018-11-07 22:14:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:17,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:17,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:17,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:17,684 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:17,684 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:17,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:17,685 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:17,694 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:17,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:14:17,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:17,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:18,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:18,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:18,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 48 [2018-11-07 22:14:18,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:18,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:14:18,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:14:18,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:14:18,786 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 48 states. [2018-11-07 22:14:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:20,935 INFO L93 Difference]: Finished difference Result 397 states and 456 transitions. [2018-11-07 22:14:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:14:20,936 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-11-07 22:14:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:20,937 INFO L225 Difference]: With dead ends: 397 [2018-11-07 22:14:20,937 INFO L226 Difference]: Without dead ends: 344 [2018-11-07 22:14:20,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 22:14:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-07 22:14:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 154. [2018-11-07 22:14:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:21,158 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:21,158 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:21,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:14:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:21,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:21,158 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:21,159 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:21,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1752422911, now seen corresponding path program 39 times [2018-11-07 22:14:21,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:21,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:21,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:21,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:21,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:21,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:21,440 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:21,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:14:21,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:21,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:21,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:21,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:21,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:21,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:22,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:22,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:22,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 47 [2018-11-07 22:14:22,348 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:22,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:14:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:14:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:14:22,349 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 47 states. [2018-11-07 22:14:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:24,955 INFO L93 Difference]: Finished difference Result 457 states and 528 transitions. [2018-11-07 22:14:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 22:14:24,956 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 119 [2018-11-07 22:14:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:24,957 INFO L225 Difference]: With dead ends: 457 [2018-11-07 22:14:24,957 INFO L226 Difference]: Without dead ends: 404 [2018-11-07 22:14:24,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 195 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:14:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-07 22:14:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 154. [2018-11-07 22:14:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:25,189 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:25,190 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:25,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:14:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:25,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:25,190 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:25,191 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:25,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1964839795, now seen corresponding path program 40 times [2018-11-07 22:14:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:25,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:25,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:25,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:25,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:25,486 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:25,487 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:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:25,487 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:25,494 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:25,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:26,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:26,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:26,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 46 [2018-11-07 22:14:26,966 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:26,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:14:26,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:14:26,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:14:26,967 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 46 states. [2018-11-07 22:14:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:29,911 INFO L93 Difference]: Finished difference Result 515 states and 598 transitions. [2018-11-07 22:14:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:14:29,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-11-07 22:14:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:29,914 INFO L225 Difference]: With dead ends: 515 [2018-11-07 22:14:29,914 INFO L226 Difference]: Without dead ends: 462 [2018-11-07 22:14:29,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 196 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:14:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-07 22:14:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 154. [2018-11-07 22:14:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:30,161 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:14:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:30,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:30,162 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:30,162 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:30,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1911429607, now seen corresponding path program 41 times [2018-11-07 22:14:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:30,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:30,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:30,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:14:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:30,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:30,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:30,504 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:30,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:14:30,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:30,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:31,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:31,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:31,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 45 [2018-11-07 22:14:31,459 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:31,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:14:31,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:14:31,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:14:31,461 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 45 states. [2018-11-07 22:14:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:34,494 INFO L93 Difference]: Finished difference Result 571 states and 666 transitions. [2018-11-07 22:14:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 22:14:34,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-11-07 22:14:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:34,497 INFO L225 Difference]: With dead ends: 571 [2018-11-07 22:14:34,497 INFO L226 Difference]: Without dead ends: 518 [2018-11-07 22:14:34,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 197 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 22:14:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-07 22:14:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 154. [2018-11-07 22:14:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:34,755 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:34,755 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:34,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:14:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:34,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:34,756 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:34,756 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 260690597, now seen corresponding path program 42 times [2018-11-07 22:14:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:34,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:34,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:35,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:35,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:35,198 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:35,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:35,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:35,199 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:35,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:35,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:35,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:35,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:35,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:35,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:35,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 44 [2018-11-07 22:14:35,873 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:35,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:14:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:14:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:14:35,874 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 44 states. [2018-11-07 22:14:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:39,000 INFO L93 Difference]: Finished difference Result 625 states and 732 transitions. [2018-11-07 22:14:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 22:14:39,000 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-11-07 22:14:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:39,002 INFO L225 Difference]: With dead ends: 625 [2018-11-07 22:14:39,002 INFO L226 Difference]: Without dead ends: 572 [2018-11-07 22:14:39,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 198 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:14:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-11-07 22:14:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 154. [2018-11-07 22:14:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:39,253 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:39,253 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:39,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:14:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:39,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:39,254 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:39,255 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:39,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash -487886287, now seen corresponding path program 43 times [2018-11-07 22:14:39,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:39,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:39,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:39,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:39,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:39,519 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:39,519 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:39,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:39,519 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:39,529 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:39,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:39,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:40,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:40,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2018-11-07 22:14:40,204 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:40,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:14:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:14:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:14:40,205 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 43 states. [2018-11-07 22:14:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:43,445 INFO L93 Difference]: Finished difference Result 677 states and 796 transitions. [2018-11-07 22:14:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 22:14:43,446 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2018-11-07 22:14:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:43,448 INFO L225 Difference]: With dead ends: 677 [2018-11-07 22:14:43,448 INFO L226 Difference]: Without dead ends: 624 [2018-11-07 22:14:43,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:14:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-07 22:14:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 154. [2018-11-07 22:14:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:43,696 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:43,696 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:43,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:14:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:43,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:43,697 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:43,698 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:43,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash -855145283, now seen corresponding path program 44 times [2018-11-07 22:14:43,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:43,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:44,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:44,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:44,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:44,138 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:44,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:44,139 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:44,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:44,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:14:44,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:44,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:44,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2018-11-07 22:14:44,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:44,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:14:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:14:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:14:44,796 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 42 states. [2018-11-07 22:14:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:48,199 INFO L93 Difference]: Finished difference Result 727 states and 858 transitions. [2018-11-07 22:14:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:14:48,200 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-11-07 22:14:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:48,202 INFO L225 Difference]: With dead ends: 727 [2018-11-07 22:14:48,203 INFO L226 Difference]: Without dead ends: 674 [2018-11-07 22:14:48,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 200 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 22:14:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-07 22:14:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 154. [2018-11-07 22:14:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:48,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:48,461 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:48,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:14:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:48,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:48,462 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:48,462 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:48,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 266259017, now seen corresponding path program 45 times [2018-11-07 22:14:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:48,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:48,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:49,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:49,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:49,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:49,189 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:49,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:49,189 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:49,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:49,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:49,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:49,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:49,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:49,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 41 [2018-11-07 22:14:50,468 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:50,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:14:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:14:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:14:50,469 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 41 states. [2018-11-07 22:14:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:53,765 INFO L93 Difference]: Finished difference Result 775 states and 918 transitions. [2018-11-07 22:14:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 22:14:53,765 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-11-07 22:14:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:53,768 INFO L225 Difference]: With dead ends: 775 [2018-11-07 22:14:53,768 INFO L226 Difference]: Without dead ends: 722 [2018-11-07 22:14:53,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 201 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:14:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-07 22:14:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 154. [2018-11-07 22:14:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 22:14:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 22:14:54,036 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 22:14:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:54,036 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 22:14:54,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:14:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 22:14:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:14:54,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:54,037 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:54,037 INFO L423 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:54,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash -157154603, now seen corresponding path program 10 times [2018-11-07 22:14:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:54,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:54,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:54,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:54,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:54,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:54,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:54,509 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:54,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:14:54,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:54,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:54,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:54,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:54,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:55,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2018-11-07 22:14:55,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:55,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:14:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:14:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:14:55,103 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 40 states. [2018-11-07 22:14:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:58,256 INFO L93 Difference]: Finished difference Result 826 states and 982 transitions. [2018-11-07 22:14:58,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:14:58,256 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-11-07 22:14:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:58,259 INFO L225 Difference]: With dead ends: 826 [2018-11-07 22:14:58,259 INFO L226 Difference]: Without dead ends: 773 [2018-11-07 22:14:58,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 202 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:14:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-11-07 22:14:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 157. [2018-11-07 22:14:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-07 22:14:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2018-11-07 22:14:58,511 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 119 [2018-11-07 22:14:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:58,511 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2018-11-07 22:14:58,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:14:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2018-11-07 22:14:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 22:14:58,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:58,512 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:58,512 INFO L423 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:58,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 777037143, now seen corresponding path program 20 times [2018-11-07 22:14:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:58,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:14:58,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:58,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:58,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:58,721 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:58,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:58,722 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:58,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:58,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:14:58,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:58,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:58,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 22:14:59,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:59,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-07 22:14:59,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:59,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:14:59,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:14:59,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:14:59,206 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 19 states. [2018-11-07 22:14:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:59,862 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-11-07 22:14:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:14:59,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-07 22:14:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:59,863 INFO L225 Difference]: With dead ends: 167 [2018-11-07 22:14:59,864 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 22:14:59,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 230 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:14:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 22:15:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-07 22:15:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 22:15:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2018-11-07 22:15:00,130 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 121 [2018-11-07 22:15:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:00,131 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2018-11-07 22:15:00,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:15:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2018-11-07 22:15:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:00,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:00,132 INFO L375 BasicCegarLoop]: trace histogram [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:15:00,132 INFO L423 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:00,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1277952389, now seen corresponding path program 21 times [2018-11-07 22:15:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:00,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:00,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:00,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:00,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:00,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:00,538 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:15:00,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:00,538 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:00,546 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:00,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:00,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:00,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:01,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 54 [2018-11-07 22:15:01,441 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:01,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 22:15:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 22:15:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 22:15:01,442 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand 54 states. [2018-11-07 22:15:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:03,276 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2018-11-07 22:15:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:15:03,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 129 [2018-11-07 22:15:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:03,277 INFO L225 Difference]: With dead ends: 294 [2018-11-07 22:15:03,277 INFO L226 Difference]: Without dead ends: 237 [2018-11-07 22:15:03,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 208 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:15:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-07 22:15:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-11-07 22:15:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:03,571 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:03,571 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:03,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 22:15:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:03,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:03,572 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:03,572 INFO L423 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1178325753, now seen corresponding path program 46 times [2018-11-07 22:15:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:03,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:03,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:03,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:03,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:03,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:03,896 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:15:03,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:03,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:03,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:03,904 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:03,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:04,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:05,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:05,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2018-11-07 22:15:05,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:05,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 22:15:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 22:15:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 22:15:05,096 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 53 states. [2018-11-07 22:15:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:07,491 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-11-07 22:15:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:15:07,492 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2018-11-07 22:15:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:07,493 INFO L225 Difference]: With dead ends: 364 [2018-11-07 22:15:07,493 INFO L226 Difference]: Without dead ends: 307 [2018-11-07 22:15:07,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 209 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 22:15:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-07 22:15:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 167. [2018-11-07 22:15:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:07,812 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:07,812 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:07,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 22:15:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:07,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:07,814 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:07,814 INFO L423 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:07,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash -154759533, now seen corresponding path program 47 times [2018-11-07 22:15:07,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:07,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:08,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:08,527 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:08,527 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:15:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:08,528 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:08,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:08,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:15:08,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:08,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:09,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2018-11-07 22:15:09,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 22:15:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 22:15:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:09,732 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 52 states. [2018-11-07 22:15:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:12,649 INFO L93 Difference]: Finished difference Result 432 states and 496 transitions. [2018-11-07 22:15:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 22:15:12,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 129 [2018-11-07 22:15:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:12,651 INFO L225 Difference]: With dead ends: 432 [2018-11-07 22:15:12,651 INFO L226 Difference]: Without dead ends: 375 [2018-11-07 22:15:12,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 210 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:15:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-07 22:15:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 167. [2018-11-07 22:15:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:12,986 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:12,986 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:12,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 22:15:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:12,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:12,987 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:12,987 INFO L423 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:12,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1607197471, now seen corresponding path program 48 times [2018-11-07 22:15:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:12,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:12,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:13,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:13,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:13,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:13,305 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:15:13,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:13,305 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:13,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:13,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:13,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:13,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:13,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:13,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:14,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:14,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-11-07 22:15:14,348 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:14,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:15:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:15:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:15:14,349 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 51 states. [2018-11-07 22:15:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:17,880 INFO L93 Difference]: Finished difference Result 498 states and 575 transitions. [2018-11-07 22:15:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:15:17,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 129 [2018-11-07 22:15:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:17,882 INFO L225 Difference]: With dead ends: 498 [2018-11-07 22:15:17,882 INFO L226 Difference]: Without dead ends: 441 [2018-11-07 22:15:17,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 22:15:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-07 22:15:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 167. [2018-11-07 22:15:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:18,224 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:18,224 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:18,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:15:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:18,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:18,225 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:18,225 INFO L423 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:18,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -285939029, now seen corresponding path program 49 times [2018-11-07 22:15:18,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:18,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:18,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:18,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:18,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:18,536 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:18,536 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:15:18,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:18,536 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:18,544 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:18,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:19,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:19,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:19,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 50 [2018-11-07 22:15:19,393 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:19,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:15:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:15:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:15:19,396 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 50 states. [2018-11-07 22:15:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:23,122 INFO L93 Difference]: Finished difference Result 562 states and 652 transitions. [2018-11-07 22:15:23,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 22:15:23,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 129 [2018-11-07 22:15:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:23,124 INFO L225 Difference]: With dead ends: 562 [2018-11-07 22:15:23,124 INFO L226 Difference]: Without dead ends: 505 [2018-11-07 22:15:23,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 212 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 22:15:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-07 22:15:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 167. [2018-11-07 22:15:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:23,464 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:23,465 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:23,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:15:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:23,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:23,465 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:23,465 INFO L423 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:23,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 798123319, now seen corresponding path program 50 times [2018-11-07 22:15:23,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:23,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:23,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:23,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:23,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:23,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:23,799 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:15:23,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:23,799 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:23,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:23,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:23,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:15:23,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:23,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:24,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:24,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:24,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 49 [2018-11-07 22:15:24,930 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:24,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:15:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:15:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:15:24,931 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 49 states. [2018-11-07 22:15:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:29,000 INFO L93 Difference]: Finished difference Result 624 states and 727 transitions. [2018-11-07 22:15:29,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 22:15:29,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-11-07 22:15:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:29,002 INFO L225 Difference]: With dead ends: 624 [2018-11-07 22:15:29,003 INFO L226 Difference]: Without dead ends: 567 [2018-11-07 22:15:29,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 213 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:15:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-07 22:15:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 167. [2018-11-07 22:15:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:29,336 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:29,336 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:29,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:15:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:29,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:29,337 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:29,337 INFO L423 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:29,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash -903540029, now seen corresponding path program 51 times [2018-11-07 22:15:29,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:29,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:29,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:29,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:29,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:29,715 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:29,716 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:15:29,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:29,716 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:29,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:29,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:29,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:29,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:30,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 48 [2018-11-07 22:15:30,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:30,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:15:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:15:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:15:30,661 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 48 states. [2018-11-07 22:15:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:34,860 INFO L93 Difference]: Finished difference Result 684 states and 800 transitions. [2018-11-07 22:15:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 22:15:34,860 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-11-07 22:15:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:34,862 INFO L225 Difference]: With dead ends: 684 [2018-11-07 22:15:34,862 INFO L226 Difference]: Without dead ends: 627 [2018-11-07 22:15:34,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 214 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:15:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-07 22:15:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 167. [2018-11-07 22:15:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:35,473 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:35,473 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:35,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:15:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:35,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:35,475 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:35,475 INFO L423 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:35,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash 274576207, now seen corresponding path program 52 times [2018-11-07 22:15:35,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:35,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:35,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:36,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:36,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:36,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:36,017 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:15:36,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:36,017 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:36,024 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:36,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:36,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:36,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 47 [2018-11-07 22:15:36,913 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:36,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:15:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:15:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:15:36,914 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 47 states. [2018-11-07 22:15:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:41,526 INFO L93 Difference]: Finished difference Result 742 states and 871 transitions. [2018-11-07 22:15:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 22:15:41,526 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 129 [2018-11-07 22:15:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:41,529 INFO L225 Difference]: With dead ends: 742 [2018-11-07 22:15:41,529 INFO L226 Difference]: Without dead ends: 685 [2018-11-07 22:15:41,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 215 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 22:15:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-07 22:15:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 167. [2018-11-07 22:15:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:41,908 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:41,908 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:41,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:15:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:41,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:41,909 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:41,909 INFO L423 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1994586405, now seen corresponding path program 53 times [2018-11-07 22:15:41,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:41,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:41,911 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:42,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:42,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:42,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:42,253 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:15:42,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:42,253 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:42,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:42,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:42,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:15:42,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:42,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:42,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:43,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2018-11-07 22:15:43,032 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:15:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:15:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:15:43,033 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 46 states. [2018-11-07 22:15:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:47,756 INFO L93 Difference]: Finished difference Result 798 states and 940 transitions. [2018-11-07 22:15:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 22:15:47,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-11-07 22:15:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:47,759 INFO L225 Difference]: With dead ends: 798 [2018-11-07 22:15:47,759 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 22:15:47,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 216 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 22:15:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 22:15:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 167. [2018-11-07 22:15:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:48,104 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:48,104 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:48,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:15:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:48,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:48,105 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:48,105 INFO L423 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2087964007, now seen corresponding path program 54 times [2018-11-07 22:15:48,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:48,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:48,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:48,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:48,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:48,426 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:48,426 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:15:48,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:48,426 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:48,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:48,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:48,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:48,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:48,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:15:49,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:49,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-07 22:15:49,172 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:49,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:15:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:15:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:15:49,174 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 45 states. [2018-11-07 22:15:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:53,828 INFO L93 Difference]: Finished difference Result 852 states and 1007 transitions. [2018-11-07 22:15:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 22:15:53,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2018-11-07 22:15:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:53,838 INFO L225 Difference]: With dead ends: 852 [2018-11-07 22:15:53,838 INFO L226 Difference]: Without dead ends: 795 [2018-11-07 22:15:53,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 217 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:15:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-11-07 22:15:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 167. [2018-11-07 22:15:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:15:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 22:15:54,325 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 22:15:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:54,325 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 22:15:54,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:15:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 22:15:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:15:54,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:54,326 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:54,326 INFO L423 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:54,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2141374195, now seen corresponding path program 55 times [2018-11-07 22:15:54,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:54,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:54,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) Received shutdown request... [2018-11-07 22:15:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-07 22:15:54,333 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-07 22:15:54,333 INFO L171 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-07 22:15:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:54,344 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-07 22:15:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:54,382 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:54,383 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:15:54,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:54,383 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:54,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:54,393 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:54,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:54,432 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-11-07 22:15:54,432 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:15:54,633 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:15:54,633 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:15:54,638 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:15:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:15:54 BoogieIcfgContainer [2018-11-07 22:15:54,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:15:54,639 INFO L168 Benchmark]: Toolchain (without parser) took 234987.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 641.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -517.8 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2018-11-07 22:15:54,640 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:15:54,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.83 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:15:54,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.08 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:15:54,641 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 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:15:54,641 INFO L168 Benchmark]: RCFGBuilder took 487.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:15:54,642 INFO L168 Benchmark]: TraceAbstraction took 234163.84 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -93.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.1 MB). Peak memory consumption was 166.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:15:54,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.83 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 20.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.13 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 487.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234163.84 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -93.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.1 MB). Peak memory consumption was 166.3 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 130 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 234.0s OverallTime, 89 OverallIterations, 12 TraceHistogramMax, 130.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4216 SDtfs, 11312 SDslu, 35247 SDs, 0 SdLazy, 32155 SolverSat, 7532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19520 GetRequests, 12916 SyntacticMatches, 1540 SemanticMatches, 5064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149303 ImplicationChecksByTransitivity, 118.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 88 MinimizatonAttempts, 16662 StatesRemovedByMinimization, 77 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 83.8s InterpolantComputationTime, 15427 NumberOfCodeBlocks, 15427 NumberOfCodeBlocksAsserted, 404 NumberOfCheckSat, 22854 ConstructedInterpolants, 0 QuantifiedInterpolants, 9084200 SizeOfPredicates, 545 NumberOfNonLiveVariables, 16590 ConjunctsInSsa, 1740 ConjunctsInUnsatCore, 258 InterpolantComputations, 3 PerfectInterpolantSequences, 60967/74867 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown