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-lit/gj2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:13:47,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:13:47,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:13:47,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:13:47,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:13:47,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:13:47,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:13:47,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:13:47,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:13:47,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:13:47,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:13:47,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:13:47,868 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:13:47,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:13:47,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:13:47,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:13:47,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:13:47,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:13:47,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:13:47,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:13:47,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:13:47,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:13:47,883 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:13:47,883 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:13:47,883 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:13:47,884 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:13:47,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:13:47,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:13:47,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:13:47,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:13:47,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:13:47,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:13:47,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:13:47,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:13:47,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:13:47,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:13:47,901 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:13:47,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:13:47,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:13:47,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:13:47,936 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:13:47,936 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:13:47,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:13:47,936 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:13:47,936 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:13:47,938 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:13:47,938 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:13:47,938 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:13:47,938 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:13:47,938 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:13:47,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:13:47,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:13:47,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:13:47,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:13:47,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:13:47,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:13:47,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:13:47,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:13:47,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:13:47,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:13:47,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:13:47,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:13:47,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:13:47,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:13:47,943 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:13:47,943 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:13:47,943 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:13:47,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:13:47,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:13:47,944 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:13:47,944 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:13:47,944 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:13:48,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:13:48,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:13:48,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:13:48,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:13:48,023 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:13:48,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-07 22:13:48,091 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d56878/84bdb140dd1d4ce9905ebf1314d3ffba/FLAG38e36544f [2018-11-07 22:13:48,497 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:13:48,500 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-07 22:13:48,508 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d56878/84bdb140dd1d4ce9905ebf1314d3ffba/FLAG38e36544f [2018-11-07 22:13:48,532 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d56878/84bdb140dd1d4ce9905ebf1314d3ffba [2018-11-07 22:13:48,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:13:48,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:13:48,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:48,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:13:48,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:13:48,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0e6d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48, skipping insertion in model container [2018-11-07 22:13:48,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:13:48,599 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:13:48,813 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:48,817 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:13:48,834 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:48,848 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:13:48,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48 WrapperNode [2018-11-07 22:13:48,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:48,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:48,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:13:48,849 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:13:48,858 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:13:48" (1/1) ... [2018-11-07 22:13:48,863 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:13:48" (1/1) ... [2018-11-07 22:13:48,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:48,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:13:48,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:13:48,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:13:48,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (1/1) ... [2018-11-07 22:13:48,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:13:48,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:13:48,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:13:48,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:13:48,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (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:13:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:13:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:13:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:13:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:13:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:13:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:13:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:13:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:13:49,287 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:13:49,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:49 BoogieIcfgContainer [2018-11-07 22:13:49,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:13:49,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:13:49,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:13:49,292 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:13:49,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:48" (1/3) ... [2018-11-07 22:13:49,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a2f8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:49, skipping insertion in model container [2018-11-07 22:13:49,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:48" (2/3) ... [2018-11-07 22:13:49,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a2f8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:49, skipping insertion in model container [2018-11-07 22:13:49,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:49" (3/3) ... [2018-11-07 22:13:49,295 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i [2018-11-07 22:13:49,305 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:13:49,313 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:13:49,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:13:49,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:13:49,363 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:13:49,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:13:49,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:13:49,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:13:49,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:13:49,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:13:49,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:13:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 22:13:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 22:13:49,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:49,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:49,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:49,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-07 22:13:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:49,503 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:13:49,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:49,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:13:49,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:49,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:13:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:13:49,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:13:49,524 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 22:13:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:49,547 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-07 22:13:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:13:49,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 22:13:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:49,556 INFO L225 Difference]: With dead ends: 32 [2018-11-07 22:13:49,556 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 22:13:49,559 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:13:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 22:13:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 22:13:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 22:13:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 22:13:49,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 22:13:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:49,598 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 22:13:49,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:13:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 22:13:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 22:13:49,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:49,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:49,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:49,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:49,600 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 22:13:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:49,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:49,690 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:13:49,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:49,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:13:49,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:49,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:13:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:13:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:49,697 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 22:13:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:49,808 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 22:13:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:13:49,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 22:13:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:49,809 INFO L225 Difference]: With dead ends: 24 [2018-11-07 22:13:49,809 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 22:13:49,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 22:13:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 22:13:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 22:13:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 22:13:49,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 22:13:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:49,819 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 22:13:49,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:13:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 22:13:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:13:49,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:49,820 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:49,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:49,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 64649018, now seen corresponding path program 1 times [2018-11-07 22:13:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:49,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:49,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:49,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:49,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 22:13:49,940 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 22:13:49,967 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:13:49,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:13:50,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 22:13:50,114 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 22:13:50,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:50,155 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 22:13:50,200 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-11-07 22:13:50,201 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 22:13:50,213 INFO L415 sIntCurrentIteration]: We unified 13 AI predicates to 13 [2018-11-07 22:13:50,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 22:13:50,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:13:50,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-07 22:13:50,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:13:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:13:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:50,219 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-07 22:13:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:50,303 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-07 22:13:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:13:50,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 22:13:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:50,304 INFO L225 Difference]: With dead ends: 24 [2018-11-07 22:13:50,304 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 22:13:50,305 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 22:13:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 22:13:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 22:13:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-07 22:13:50,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-11-07 22:13:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:50,311 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-07 22:13:50,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:13:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-07 22:13:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:13:50,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:50,314 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:50,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:50,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1506199393, now seen corresponding path program 1 times [2018-11-07 22:13:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:50,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:50,392 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 22:13:50,392 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 22:13:50,393 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:13:50,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:13:50,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:13:50,457 INFO L272 AbstractInterpreter]: Visited 14 different actions 53 times. Merged at 5 different actions 22 times. Widened at 2 different actions 3 times. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 22:13:50,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:50,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:13:50,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,470 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:13:50,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:50,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:50,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:50,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:50,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 22:13:50,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:50,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:13:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:13:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:50,644 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-11-07 22:13:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:50,718 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 22:13:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:13:50,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-07 22:13:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:50,720 INFO L225 Difference]: With dead ends: 30 [2018-11-07 22:13:50,720 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:13:50,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:13:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:13:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:13:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-07 22:13:50,727 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-07 22:13:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:50,728 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-07 22:13:50,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:13:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-07 22:13:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:13:50,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:50,730 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:50,730 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:50,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1748455324, now seen corresponding path program 2 times [2018-11-07 22:13:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:50,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:50,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:50,886 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,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:50,886 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:13:50,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:50,905 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:50,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:13:50,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:50,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:13:51,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:13:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:51,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-11-07 22:13:51,230 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:51,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:13:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:13:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:51,232 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2018-11-07 22:13:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:51,302 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-07 22:13:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:51,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 22:13:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:51,305 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:13:51,305 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 22:13:51,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 22:13:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-07 22:13:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 22:13:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-07 22:13:51,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2018-11-07 22:13:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:51,316 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-07 22:13:51,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:13:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-07 22:13:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 22:13:51,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:51,317 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:51,317 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:51,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1522422854, now seen corresponding path program 3 times [2018-11-07 22:13:51,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:51,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:51,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:51,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:51,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:51,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:51,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,408 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:13:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:51,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:51,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:51,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:51,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:51,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:51,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:51,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 22:13:51,671 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:51,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:51,672 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-07 22:13:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:51,706 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-07 22:13:51,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:13:51,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-07 22:13:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:51,707 INFO L225 Difference]: With dead ends: 43 [2018-11-07 22:13:51,707 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 22:13:51,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 22:13:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 22:13:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 22:13:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-07 22:13:51,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2018-11-07 22:13:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:51,716 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-07 22:13:51,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-07 22:13:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:13:51,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:51,717 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:51,718 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:51,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 634861023, now seen corresponding path program 4 times [2018-11-07 22:13:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:51,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:51,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:51,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:51,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:51,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:51,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:51,825 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:13:51,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:51,835 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:51,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:51,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:52,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:52,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 22:13:52,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:52,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:13:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:13:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:13:52,296 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-07 22:13:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:52,336 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-07 22:13:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:52,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-07 22:13:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:52,338 INFO L225 Difference]: With dead ends: 46 [2018-11-07 22:13:52,338 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:13:52,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:13:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:13:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 22:13:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 22:13:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 22:13:52,346 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-07 22:13:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 22:13:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:13:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 22:13:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 22:13:52,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:52,348 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:52,348 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:52,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1611776614, now seen corresponding path program 5 times [2018-11-07 22:13:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:52,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:52,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:13:52,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:52,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:52,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:52,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:52,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:52,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 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:13:52,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:52,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:52,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:13:52,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:52,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 22:13:52,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 22:13:52,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:52,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2018-11-07 22:13:52,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:52,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:13:52,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:13:52,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:13:52,729 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-11-07 22:13:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:52,871 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-07 22:13:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:13:52,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 22:13:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:52,874 INFO L225 Difference]: With dead ends: 53 [2018-11-07 22:13:52,875 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 22:13:52,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:13:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 22:13:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 22:13:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 22:13:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 22:13:52,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2018-11-07 22:13:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:52,883 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 22:13:52,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:13:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 22:13:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 22:13:52,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:52,884 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:52,884 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:52,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2007233660, now seen corresponding path program 6 times [2018-11-07 22:13:52,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:52,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:52,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:53,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:53,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:53,015 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:53,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:53,015 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:13:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:53,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:53,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:53,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:53,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:53,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 22:13:53,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:53,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:13:53,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:13:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:13:53,323 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-07 22:13:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:53,373 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-07 22:13:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:13:53,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-07 22:13:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:53,376 INFO L225 Difference]: With dead ends: 58 [2018-11-07 22:13:53,376 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 22:13:53,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:13:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 22:13:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 22:13:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 22:13:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-07 22:13:53,383 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 38 [2018-11-07 22:13:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:53,384 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-07 22:13:53,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:13:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-07 22:13:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 22:13:53,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:53,386 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:53,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:53,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash -617976031, now seen corresponding path program 7 times [2018-11-07 22:13:53,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:53,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:53,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:53,388 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:53,547 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:53,547 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:53,548 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:53,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:53,548 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:13:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:53,556 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:53,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:53,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:53,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 22:13:53,937 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:53,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:13:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:13:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:13:53,940 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-11-07 22:13:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:54,017 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 22:13:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:13:54,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-07 22:13:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:54,018 INFO L225 Difference]: With dead ends: 61 [2018-11-07 22:13:54,019 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 22:13:54,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:13:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 22:13:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-07 22:13:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 22:13:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-07 22:13:54,028 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-07 22:13:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:54,030 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-07 22:13:54,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:13:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-07 22:13:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 22:13:54,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:54,035 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:54,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:54,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1180387748, now seen corresponding path program 8 times [2018-11-07 22:13:54,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 22:13:54,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,230 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:54,230 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:54,230 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,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,231 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:13:54,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:54,239 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:54,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:13:54,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:54,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:54,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:13:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2018-11-07 22:13:54,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:54,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:13:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:13:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:13:54,484 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 15 states. [2018-11-07 22:13:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:54,563 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-07 22:13:54,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:13:54,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-07 22:13:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:54,570 INFO L225 Difference]: With dead ends: 68 [2018-11-07 22:13:54,570 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 22:13:54,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:13:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 22:13:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 22:13:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 22:13:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-07 22:13:54,578 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 44 [2018-11-07 22:13:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:54,578 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-07 22:13:54,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:13:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-07 22:13:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 22:13:54,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:54,579 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:54,580 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:54,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 451431418, now seen corresponding path program 9 times [2018-11-07 22:13:54,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:54,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:54,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:54,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:54,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:54,730 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:54,731 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,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:54,731 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:13:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:54,745 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:54,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:54,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:54,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:54,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:55,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:55,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 22:13:55,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:55,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:13:55,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:13:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:13:55,058 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 12 states. [2018-11-07 22:13:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:55,122 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-07 22:13:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:13:55,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-07 22:13:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:55,124 INFO L225 Difference]: With dead ends: 73 [2018-11-07 22:13:55,124 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 22:13:55,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:13:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 22:13:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 22:13:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:13:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 22:13:55,132 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 50 [2018-11-07 22:13:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:55,133 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 22:13:55,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:13:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 22:13:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 22:13:55,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:55,134 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:55,135 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:55,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1862600929, now seen corresponding path program 10 times [2018-11-07 22:13:55,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:55,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:55,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:55,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:55,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:55,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:13:55,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:55,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 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:13:55,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:55,314 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:55,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:55,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:55,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 22:13:55,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:55,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:13:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:13:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:13:55,807 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 13 states. [2018-11-07 22:13:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:55,978 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-07 22:13:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:13:55,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-07 22:13:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:55,980 INFO L225 Difference]: With dead ends: 76 [2018-11-07 22:13:55,980 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 22:13:55,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:13:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 22:13:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-07 22:13:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 22:13:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-07 22:13:55,987 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 53 [2018-11-07 22:13:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:55,988 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-07 22:13:55,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:13:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-07 22:13:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 22:13:55,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:55,989 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:55,990 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:55,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash -680182310, now seen corresponding path program 11 times [2018-11-07 22:13:55,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:55,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:55,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:13:56,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:56,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:56,473 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:56,473 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:56,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:56,473 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:13:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:56,486 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:56,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:13:56,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:56,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 154 proven. 26 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 22:13:56,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 154 proven. 26 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 22:13:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2018-11-07 22:13:56,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:56,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:13:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:13:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:13:56,861 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 19 states. [2018-11-07 22:13:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:56,966 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-07 22:13:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:13:56,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-07 22:13:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:56,968 INFO L225 Difference]: With dead ends: 83 [2018-11-07 22:13:56,968 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 22:13:56,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:13:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 22:13:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 22:13:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:13:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 22:13:56,976 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 56 [2018-11-07 22:13:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:56,976 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 22:13:56,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:13:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 22:13:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 22:13:56,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:56,978 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:56,978 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:56,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:56,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1651373252, now seen corresponding path program 12 times [2018-11-07 22:13:56,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:56,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:56,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:57,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:57,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:57,176 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:57,176 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:57,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:57,177 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:13:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:57,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:57,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:57,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:57,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:57,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:58,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:58,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 22:13:58,002 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:58,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:13:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:13:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:13:58,003 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 15 states. [2018-11-07 22:13:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:58,135 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-07 22:13:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:13:58,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-07 22:13:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:58,137 INFO L225 Difference]: With dead ends: 88 [2018-11-07 22:13:58,137 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 22:13:58,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:13:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 22:13:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 22:13:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 22:13:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-07 22:13:58,145 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 62 [2018-11-07 22:13:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:58,145 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-07 22:13:58,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:13:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-07 22:13:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 22:13:58,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:58,147 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:58,147 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:58,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2031343903, now seen corresponding path program 13 times [2018-11-07 22:13:58,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:58,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:58,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:58,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:58,344 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:58,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:58,344 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:13:58,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:58,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:58,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:58,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:58,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 22:13:58,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:58,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:13:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:13:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:13:58,787 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 16 states. [2018-11-07 22:13:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:58,856 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-07 22:13:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:13:58,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-11-07 22:13:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:58,858 INFO L225 Difference]: With dead ends: 91 [2018-11-07 22:13:58,859 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:13:58,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:13:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:13:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-07 22:13:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 22:13:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-07 22:13:58,866 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 65 [2018-11-07 22:13:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:58,867 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-07 22:13:58,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:13:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-07 22:13:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 22:13:58,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:58,868 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:58,868 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:58,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash -203215588, now seen corresponding path program 14 times [2018-11-07 22:13:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:58,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 22:13:59,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:59,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:59,058 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:59,058 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,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:59,059 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:13:59,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:59,067 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:59,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:13:59,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:59,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 238 proven. 40 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 22:13:59,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 238 proven. 40 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 22:13:59,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:59,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 29 [2018-11-07 22:13:59,674 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:59,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:13:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:13:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:13:59,675 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 23 states. [2018-11-07 22:13:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:59,894 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-07 22:13:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:13:59,895 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-07 22:13:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:59,896 INFO L225 Difference]: With dead ends: 98 [2018-11-07 22:13:59,896 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 22:13:59,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:13:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 22:13:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 22:13:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 22:13:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-11-07 22:13:59,907 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 68 [2018-11-07 22:13:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:59,909 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-07 22:13:59,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:13:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-07 22:13:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 22:13:59,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:59,910 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:59,910 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:59,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1919493062, now seen corresponding path program 15 times [2018-11-07 22:13:59,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:59,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:59,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:00,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:00,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:00,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:00,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:00,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:00,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:00,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:00,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:00,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:00,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:00,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:00,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:00,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 22:14:00,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:00,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:14:00,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:14:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:14:00,705 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 18 states. [2018-11-07 22:14:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:00,783 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-11-07 22:14:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:14:00,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-07 22:14:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:00,784 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:14:00,784 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 22:14:00,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:14:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 22:14:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 22:14:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 22:14:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-11-07 22:14:00,792 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 74 [2018-11-07 22:14:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-11-07 22:14:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:14:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-11-07 22:14:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 22:14:00,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:00,794 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:00,794 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:00,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -871126945, now seen corresponding path program 16 times [2018-11-07 22:14:00,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:00,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:00,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:01,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:01,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:01,460 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:01,460 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:01,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:01,460 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:14:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:01,469 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:01,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:01,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:02,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:02,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 22:14:02,587 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:02,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:14:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:14:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:14:02,588 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 19 states. [2018-11-07 22:14:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:02,678 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-07 22:14:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:14:02,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-11-07 22:14:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:02,679 INFO L225 Difference]: With dead ends: 106 [2018-11-07 22:14:02,679 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 22:14:02,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:14:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 22:14:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-07 22:14:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 22:14:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-11-07 22:14:02,686 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 77 [2018-11-07 22:14:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:02,686 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-11-07 22:14:02,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:14:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-11-07 22:14:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 22:14:02,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:02,688 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:02,688 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:02,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1998311910, now seen corresponding path program 17 times [2018-11-07 22:14:02,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:14:03,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:03,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:03,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:03,095 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:03,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:03,095 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:14:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:03,108 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:03,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:14:03,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:03,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 340 proven. 57 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-07 22:14:03,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 340 proven. 57 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-07 22:14:03,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:03,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 34 [2018-11-07 22:14:03,972 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:03,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:14:03,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:14:03,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:14:03,973 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 27 states. [2018-11-07 22:14:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:04,276 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-11-07 22:14:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:14:04,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-11-07 22:14:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:04,278 INFO L225 Difference]: With dead ends: 113 [2018-11-07 22:14:04,279 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 22:14:04,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:14:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 22:14:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 22:14:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:14:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-07 22:14:04,285 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 80 [2018-11-07 22:14:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:04,286 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-07 22:14:04,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:14:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-07 22:14:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 22:14:04,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:04,287 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 18, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:04,287 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:04,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1090859516, now seen corresponding path program 18 times [2018-11-07 22:14:04,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:04,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:04,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:05,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:05,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:05,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:05,151 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:05,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:05,151 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:14:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:05,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:05,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:05,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:05,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:05,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:05,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:05,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 22:14:05,641 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:05,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:14:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:14:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:14:05,643 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 21 states. [2018-11-07 22:14:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:05,705 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-07 22:14:05,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:14:05,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-07 22:14:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:05,707 INFO L225 Difference]: With dead ends: 118 [2018-11-07 22:14:05,707 INFO L226 Difference]: Without dead ends: 90 [2018-11-07 22:14:05,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:14:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-07 22:14:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-07 22:14:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 22:14:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-11-07 22:14:05,713 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 86 [2018-11-07 22:14:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:05,713 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-11-07 22:14:05,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:14:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-07 22:14:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:14:05,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:05,714 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:05,715 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:05,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2019561823, now seen corresponding path program 19 times [2018-11-07 22:14:05,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:05,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:05,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:05,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:05,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:05,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:05,950 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:05,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:05,950 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:14:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:05,961 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:05,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:05,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:06,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 22:14:06,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:06,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:14:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:14:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:14:06,692 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 22 states. [2018-11-07 22:14:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:06,806 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-11-07 22:14:06,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:14:06,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-11-07 22:14:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:06,811 INFO L225 Difference]: With dead ends: 121 [2018-11-07 22:14:06,812 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 22:14:06,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:14:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 22:14:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 22:14:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 22:14:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-07 22:14:06,818 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 89 [2018-11-07 22:14:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:06,819 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-07 22:14:06,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:14:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-07 22:14:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 22:14:06,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:06,820 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:06,820 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:06,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -662260772, now seen corresponding path program 20 times [2018-11-07 22:14:06,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 22:14:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:07,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:07,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:07,088 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,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:07,088 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:14:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:07,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:07,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:14:07,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:07,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-07 22:14:07,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-07 22:14:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:07,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 39 [2018-11-07 22:14:07,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:14:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:14:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:14:07,518 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 31 states. [2018-11-07 22:14:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:07,769 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2018-11-07 22:14:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:14:07,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-11-07 22:14:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:07,770 INFO L225 Difference]: With dead ends: 128 [2018-11-07 22:14:07,770 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 22:14:07,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:14:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 22:14:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-07 22:14:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 22:14:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-07 22:14:07,776 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 92 [2018-11-07 22:14:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:07,777 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-07 22:14:07,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:14:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-07 22:14:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 22:14:07,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:07,778 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 21, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:07,778 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:07,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 976837754, now seen corresponding path program 21 times [2018-11-07 22:14:07,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:07,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:07,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:07,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:07,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:08,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:08,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:08,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:08,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:08,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:08,258 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:14:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:08,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:08,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:08,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:08,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:08,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:09,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:09,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 22:14:09,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:14:09,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:14:09,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:14:09,132 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 24 states. [2018-11-07 22:14:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:09,226 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-07 22:14:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:14:09,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-07 22:14:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:09,228 INFO L225 Difference]: With dead ends: 133 [2018-11-07 22:14:09,229 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 22:14:09,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:14:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 22:14:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-07 22:14:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:14:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 22:14:09,236 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 98 [2018-11-07 22:14:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:09,236 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 22:14:09,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:14:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 22:14:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 22:14:09,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:09,237 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:09,237 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:09,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1561151903, now seen corresponding path program 22 times [2018-11-07 22:14:09,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:09,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:09,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:09,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:09,528 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:09,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:09,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 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:14:09,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:09,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:09,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:09,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:10,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:10,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 22:14:10,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:10,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:14:10,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:14:10,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:14:10,235 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 25 states. [2018-11-07 22:14:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:10,317 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-11-07 22:14:10,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:14:10,318 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2018-11-07 22:14:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:10,319 INFO L225 Difference]: With dead ends: 136 [2018-11-07 22:14:10,319 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:14:10,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:14:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:14:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-07 22:14:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 22:14:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-11-07 22:14:10,325 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 101 [2018-11-07 22:14:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:10,326 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-11-07 22:14:10,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:14:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-11-07 22:14:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 22:14:10,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:10,327 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:10,327 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:10,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1361514074, now seen corresponding path program 23 times [2018-11-07 22:14:10,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 22:14:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:10,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:10,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:10,718 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,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:10,718 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:14:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:10,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:10,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 22:14:10,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:10,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 598 proven. 100 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 22:14:10,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 598 proven. 100 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 22:14:11,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:11,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11, 11] total 44 [2018-11-07 22:14:11,196 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:11,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:14:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:14:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:14:11,198 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 35 states. [2018-11-07 22:14:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:11,376 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2018-11-07 22:14:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:14:11,377 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 104 [2018-11-07 22:14:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:11,378 INFO L225 Difference]: With dead ends: 143 [2018-11-07 22:14:11,378 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 22:14:11,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:14:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 22:14:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-07 22:14:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 22:14:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-11-07 22:14:11,384 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 104 [2018-11-07 22:14:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:11,385 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-11-07 22:14:11,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:14:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-11-07 22:14:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 22:14:11,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:11,386 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 24, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:11,386 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:11,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1687251132, now seen corresponding path program 24 times [2018-11-07 22:14:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:11,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:11,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:11,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:11,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:11,961 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:11,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:11,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:11,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:11,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:11,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:11,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:12,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:12,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:12,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:12,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 22:14:12,803 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:12,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:14:12,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:14:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:12,804 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 27 states. [2018-11-07 22:14:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:12,942 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-11-07 22:14:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:14:12,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-07 22:14:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:12,943 INFO L225 Difference]: With dead ends: 148 [2018-11-07 22:14:12,943 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 22:14:12,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 22:14:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 22:14:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 22:14:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-11-07 22:14:12,950 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 110 [2018-11-07 22:14:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:12,950 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-11-07 22:14:12,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:14:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-11-07 22:14:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 22:14:12,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:12,951 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:12,952 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1462122911, now seen corresponding path program 25 times [2018-11-07 22:14:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:13,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:13,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:13,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:13,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:13,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:13,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 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:14:13,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:13,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:13,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:14,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-11-07 22:14:14,417 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:14,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:14:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:14:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:14,419 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 28 states. [2018-11-07 22:14:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:14,924 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-11-07 22:14:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:14:14,924 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-11-07 22:14:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:14,925 INFO L225 Difference]: With dead ends: 151 [2018-11-07 22:14:14,926 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 22:14:14,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 22:14:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-07 22:14:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 22:14:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-11-07 22:14:14,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 113 [2018-11-07 22:14:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:14,933 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-11-07 22:14:14,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:14:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-11-07 22:14:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 22:14:14,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:14,934 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:14,934 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:14,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash -903656804, now seen corresponding path program 26 times [2018-11-07 22:14:14,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:14,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:14,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:14,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 22:14:15,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:15,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:15,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:15,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:15,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:15,332 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:14:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:15,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:15,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 22:14:15,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:15,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 754 proven. 126 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-07 22:14:15,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 754 proven. 126 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-07 22:14:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 12] total 49 [2018-11-07 22:14:15,986 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:14:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:14:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:14:15,987 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 39 states. [2018-11-07 22:14:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:16,224 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2018-11-07 22:14:16,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:14:16,228 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 116 [2018-11-07 22:14:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:16,230 INFO L225 Difference]: With dead ends: 158 [2018-11-07 22:14:16,230 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 22:14:16,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:14:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 22:14:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-07 22:14:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 22:14:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-11-07 22:14:16,237 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 116 [2018-11-07 22:14:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:16,237 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-07 22:14:16,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:14:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-11-07 22:14:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 22:14:16,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:16,238 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:16,238 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:16,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 482069690, now seen corresponding path program 27 times [2018-11-07 22:14:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:16,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:16,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:17,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:17,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:17,005 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:17,006 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,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:17,006 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:14:17,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:17,020 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:17,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:17,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:17,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:17,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:18,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:18,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-11-07 22:14:18,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:18,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:14:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:14:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:18,238 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 30 states. [2018-11-07 22:14:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:19,362 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2018-11-07 22:14:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:14:19,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2018-11-07 22:14:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:19,363 INFO L225 Difference]: With dead ends: 163 [2018-11-07 22:14:19,364 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 22:14:19,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 217 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 22:14:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 22:14:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 22:14:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-07 22:14:19,371 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 122 [2018-11-07 22:14:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-07 22:14:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:14:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-07 22:14:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 22:14:19,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:19,372 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:19,372 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:19,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1999381793, now seen corresponding path program 28 times [2018-11-07 22:14:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:19,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:19,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:20,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:20,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:20,921 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:20,921 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:20,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:20,921 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:14:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:20,930 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:20,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:20,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:21,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:21,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-11-07 22:14:21,777 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:21,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:14:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:14:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:21,778 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 31 states. [2018-11-07 22:14:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:21,965 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2018-11-07 22:14:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:14:21,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2018-11-07 22:14:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:21,967 INFO L225 Difference]: With dead ends: 166 [2018-11-07 22:14:21,967 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 22:14:21,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 22:14:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-07 22:14:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 22:14:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-11-07 22:14:21,973 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 125 [2018-11-07 22:14:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:21,973 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-11-07 22:14:21,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:14:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-11-07 22:14:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 22:14:21,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:21,974 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:21,974 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:21,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1943413094, now seen corresponding path program 29 times [2018-11-07 22:14:21,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:21,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:21,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:21,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:21,975 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 22:14:22,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:22,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:22,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:22,453 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:22,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:22,453 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:14:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:22,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:22,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 22:14:22,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:22,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 928 proven. 155 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 22:14:22,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 928 proven. 155 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 22:14:23,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13, 13] total 54 [2018-11-07 22:14:23,346 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:23,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:14:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:14:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 22:14:23,348 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 43 states. [2018-11-07 22:14:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:23,622 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2018-11-07 22:14:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:14:23,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 128 [2018-11-07 22:14:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:23,623 INFO L225 Difference]: With dead ends: 173 [2018-11-07 22:14:23,623 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 22:14:23,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 22:14:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 22:14:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-07 22:14:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 22:14:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2018-11-07 22:14:23,631 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 128 [2018-11-07 22:14:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:23,631 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2018-11-07 22:14:23,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:14:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2018-11-07 22:14:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 22:14:23,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:23,632 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 30, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:23,632 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:23,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash -339038340, now seen corresponding path program 30 times [2018-11-07 22:14:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:23,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:23,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:24,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:24,115 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:24,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:24,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,116 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:14:24,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:24,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:24,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:24,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:24,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:24,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:25,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:25,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-11-07 22:14:25,025 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:25,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:14:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:14:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:25,026 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand 33 states. [2018-11-07 22:14:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:25,525 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2018-11-07 22:14:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:14:25,525 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-11-07 22:14:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:25,526 INFO L225 Difference]: With dead ends: 178 [2018-11-07 22:14:25,526 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 22:14:25,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 238 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 22:14:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-07 22:14:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 22:14:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-11-07 22:14:25,535 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 134 [2018-11-07 22:14:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:25,535 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-11-07 22:14:25,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:14:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-11-07 22:14:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 22:14:25,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:25,537 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:25,537 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:25,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1758613983, now seen corresponding path program 31 times [2018-11-07 22:14:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:25,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:25,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:26,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:26,846 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:26,847 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:26,847 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:26,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:26,847 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:14:26,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:26,855 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:26,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:26,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:27,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:27,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-11-07 22:14:27,792 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:14:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:14:27,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:27,793 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 34 states. [2018-11-07 22:14:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:27,929 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2018-11-07 22:14:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:14:27,929 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 137 [2018-11-07 22:14:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:27,930 INFO L225 Difference]: With dead ends: 181 [2018-11-07 22:14:27,930 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 22:14:27,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 243 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 22:14:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-07 22:14:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:14:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 22:14:27,938 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 137 [2018-11-07 22:14:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:27,938 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 22:14:27,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:14:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 22:14:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 22:14:27,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:27,939 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:27,939 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:27,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 206369116, now seen corresponding path program 32 times [2018-11-07 22:14:27,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:27,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 22:14:29,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:29,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:29,084 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:29,084 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:29,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:29,084 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:14:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:29,101 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:29,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 22:14:29,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:29,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1120 proven. 187 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2018-11-07 22:14:29,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1120 proven. 187 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2018-11-07 22:14:30,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:30,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 59 [2018-11-07 22:14:30,172 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:30,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:14:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:14:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:14:30,173 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 47 states. [2018-11-07 22:14:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:30,428 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2018-11-07 22:14:30,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:14:30,428 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2018-11-07 22:14:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:30,430 INFO L225 Difference]: With dead ends: 188 [2018-11-07 22:14:30,430 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 22:14:30,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:14:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 22:14:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-07 22:14:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 22:14:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-11-07 22:14:30,439 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 140 [2018-11-07 22:14:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:30,440 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-11-07 22:14:30,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:14:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-11-07 22:14:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 22:14:30,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:30,441 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 33, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:30,441 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:30,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:30,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1341510406, now seen corresponding path program 33 times [2018-11-07 22:14:30,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:30,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:31,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:31,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:31,118 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:31,119 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:31,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:31,119 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:14:31,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:31,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:31,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:31,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:31,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:31,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:32,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:32,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-11-07 22:14:32,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:32,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:14:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:14:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:32,103 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 36 states. [2018-11-07 22:14:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:32,685 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-07 22:14:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:14:32,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 146 [2018-11-07 22:14:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:32,686 INFO L225 Difference]: With dead ends: 193 [2018-11-07 22:14:32,687 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 22:14:32,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 259 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 22:14:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-07 22:14:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 22:14:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-11-07 22:14:32,694 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 146 [2018-11-07 22:14:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:32,695 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-11-07 22:14:32,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:14:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-11-07 22:14:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 22:14:32,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:32,696 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 34, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:32,696 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:32,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 324230175, now seen corresponding path program 34 times [2018-11-07 22:14:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:32,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:32,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:33,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:33,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:33,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:33,789 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:33,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:33,790 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:14:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:33,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:33,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:33,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:34,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:34,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-11-07 22:14:34,742 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:34,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:14:34,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:14:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:34,744 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 37 states. [2018-11-07 22:14:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:35,004 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-07 22:14:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:14:35,005 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-11-07 22:14:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:35,006 INFO L225 Difference]: With dead ends: 196 [2018-11-07 22:14:35,007 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 22:14:35,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 22:14:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-11-07 22:14:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 22:14:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-11-07 22:14:35,014 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 149 [2018-11-07 22:14:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:35,015 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-11-07 22:14:35,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:14:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-11-07 22:14:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 22:14:35,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:35,016 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:35,016 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:35,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 349740762, now seen corresponding path program 35 times [2018-11-07 22:14:35,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:35,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:35,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 22:14:35,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:35,839 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:35,839 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:35,839 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,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:35,840 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:14:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:35,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:36,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 22:14:36,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:36,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1330 proven. 222 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2018-11-07 22:14:36,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1330 proven. 222 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2018-11-07 22:14:37,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:37,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 15, 15] total 64 [2018-11-07 22:14:37,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:37,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:14:37,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:14:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:14:37,075 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 51 states. [2018-11-07 22:14:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:37,329 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2018-11-07 22:14:37,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 22:14:37,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 152 [2018-11-07 22:14:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:37,332 INFO L225 Difference]: With dead ends: 203 [2018-11-07 22:14:37,332 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 22:14:37,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:14:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 22:14:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-07 22:14:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 22:14:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-11-07 22:14:37,340 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 152 [2018-11-07 22:14:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:37,340 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-11-07 22:14:37,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:14:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-11-07 22:14:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 22:14:37,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:37,341 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 36, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:37,341 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:37,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash -616233412, now seen corresponding path program 36 times [2018-11-07 22:14:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:37,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:37,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:37,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:37,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:38,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:38,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:38,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:38,169 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:38,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:38,169 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:14:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:38,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:38,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:38,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:38,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:38,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:39,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-11-07 22:14:39,546 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:39,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:14:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:14:39,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:39,547 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 39 states. [2018-11-07 22:14:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:39,712 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2018-11-07 22:14:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:14:39,712 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 158 [2018-11-07 22:14:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:39,714 INFO L225 Difference]: With dead ends: 208 [2018-11-07 22:14:39,714 INFO L226 Difference]: Without dead ends: 162 [2018-11-07 22:14:39,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 280 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-07 22:14:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-07 22:14:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 22:14:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-11-07 22:14:39,722 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 158 [2018-11-07 22:14:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:39,722 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-11-07 22:14:39,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:14:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-11-07 22:14:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 22:14:39,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:39,723 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 37, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:39,724 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 539993569, now seen corresponding path program 37 times [2018-11-07 22:14:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:39,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:39,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:40,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:40,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:40,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:40,439 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:40,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:40,439 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:14:40,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:40,447 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:40,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:40,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:42,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:42,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-11-07 22:14:42,379 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:42,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:14:42,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:14:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:42,380 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 40 states. [2018-11-07 22:14:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:42,535 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2018-11-07 22:14:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:14:42,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 161 [2018-11-07 22:14:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:42,543 INFO L225 Difference]: With dead ends: 211 [2018-11-07 22:14:42,543 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 22:14:42,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 285 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 22:14:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-07 22:14:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 22:14:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2018-11-07 22:14:42,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 161 [2018-11-07 22:14:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:42,559 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2018-11-07 22:14:42,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:14:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2018-11-07 22:14:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 22:14:42,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:42,560 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:42,561 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:42,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 60270620, now seen corresponding path program 38 times [2018-11-07 22:14:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:42,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 22:14:43,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:43,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:43,259 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:43,259 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:43,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:43,259 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:14:43,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:43,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:43,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 22:14:43,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:43,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1558 proven. 260 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2018-11-07 22:14:44,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1558 proven. 260 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2018-11-07 22:14:44,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:44,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 16, 16] total 69 [2018-11-07 22:14:44,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:44,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 22:14:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 22:14:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:14:44,706 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand 55 states. [2018-11-07 22:14:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:45,116 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2018-11-07 22:14:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:14:45,116 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 164 [2018-11-07 22:14:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:45,118 INFO L225 Difference]: With dead ends: 218 [2018-11-07 22:14:45,118 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 22:14:45,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:14:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 22:14:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-07 22:14:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 22:14:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-11-07 22:14:45,125 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 164 [2018-11-07 22:14:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:45,126 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-11-07 22:14:45,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 22:14:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-11-07 22:14:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 22:14:45,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:45,127 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 39, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:45,127 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:45,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1374651078, now seen corresponding path program 39 times [2018-11-07 22:14:45,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:45,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:45,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:45,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:45,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:45,892 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:45,892 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:45,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:45,892 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:14:45,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:45,901 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:45,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:45,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:45,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:45,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:46,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:46,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-11-07 22:14:46,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:46,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:14:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:14:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:46,885 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 42 states. [2018-11-07 22:14:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:47,003 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-11-07 22:14:47,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:14:47,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2018-11-07 22:14:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:47,004 INFO L225 Difference]: With dead ends: 223 [2018-11-07 22:14:47,004 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 22:14:47,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 301 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 22:14:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-11-07 22:14:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 22:14:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-11-07 22:14:47,013 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 170 [2018-11-07 22:14:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:47,013 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-11-07 22:14:47,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:14:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-11-07 22:14:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 22:14:47,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:47,014 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 40, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:47,014 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:47,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -8925857, now seen corresponding path program 40 times [2018-11-07 22:14:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:47,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:47,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:48,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:48,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:48,634 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:48,634 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:48,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:48,634 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:14:48,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:48,642 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:48,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:48,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:50,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-11-07 22:14:50,119 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:50,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:14:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:14:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:50,120 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 43 states. [2018-11-07 22:14:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:50,248 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2018-11-07 22:14:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:14:50,250 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-11-07 22:14:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:50,251 INFO L225 Difference]: With dead ends: 226 [2018-11-07 22:14:50,251 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 22:14:50,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 306 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 22:14:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-07 22:14:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 22:14:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2018-11-07 22:14:50,259 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 173 [2018-11-07 22:14:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2018-11-07 22:14:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:14:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2018-11-07 22:14:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 22:14:50,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:50,261 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:50,261 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:50,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash 85937946, now seen corresponding path program 41 times [2018-11-07 22:14:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:50,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:50,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 22:14:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:51,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:51,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:51,016 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:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:51,016 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:14:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:51,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:51,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 22:14:51,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:51,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1804 proven. 301 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2018-11-07 22:14:51,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1804 proven. 301 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2018-11-07 22:14:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:52,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 17, 17] total 74 [2018-11-07 22:14:52,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:52,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 22:14:52,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 22:14:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:14:52,422 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand 59 states. [2018-11-07 22:14:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:52,753 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2018-11-07 22:14:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:14:52,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 176 [2018-11-07 22:14:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:52,755 INFO L225 Difference]: With dead ends: 233 [2018-11-07 22:14:52,755 INFO L226 Difference]: Without dead ends: 184 [2018-11-07 22:14:52,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:14:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-07 22:14:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-07 22:14:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 22:14:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2018-11-07 22:14:52,761 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 176 [2018-11-07 22:14:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:52,761 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2018-11-07 22:14:52,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 22:14:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2018-11-07 22:14:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 22:14:52,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:52,762 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 42, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:52,762 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:52,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1735103236, now seen corresponding path program 42 times [2018-11-07 22:14:52,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:52,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:52,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:52,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:53,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:53,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:53,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:53,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:53,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:53,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:53,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:53,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:53,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:53,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:53,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:53,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:55,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-11-07 22:14:55,109 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:55,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:14:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:14:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:55,110 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand 45 states. [2018-11-07 22:14:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:55,313 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2018-11-07 22:14:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:14:55,313 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 182 [2018-11-07 22:14:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:55,315 INFO L225 Difference]: With dead ends: 238 [2018-11-07 22:14:55,315 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 22:14:55,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 322 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 22:14:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-07 22:14:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 22:14:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2018-11-07 22:14:55,323 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 182 [2018-11-07 22:14:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:55,324 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2018-11-07 22:14:55,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:14:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2018-11-07 22:14:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 22:14:55,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:55,325 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 43, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:55,325 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:55,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1920183713, now seen corresponding path program 43 times [2018-11-07 22:14:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:55,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:55,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:56,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:56,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:56,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:56,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:56,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:56,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 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:14:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:56,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:56,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:56,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:57,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:57,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-11-07 22:14:57,229 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:57,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:14:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:14:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:57,230 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand 46 states. [2018-11-07 22:14:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:57,491 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2018-11-07 22:14:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:14:57,492 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2018-11-07 22:14:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:57,493 INFO L225 Difference]: With dead ends: 241 [2018-11-07 22:14:57,493 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 22:14:57,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 327 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:14:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 22:14:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-07 22:14:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 22:14:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2018-11-07 22:14:57,500 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 185 [2018-11-07 22:14:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2018-11-07 22:14:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:14:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2018-11-07 22:14:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 22:14:57,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:57,502 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:57,502 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:57,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1972858588, now seen corresponding path program 44 times [2018-11-07 22:14:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:57,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:57,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 22:14:59,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:59,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:59,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:59,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:14:59,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:59,849 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:14:59,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:59,860 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:59,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 22:14:59,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:59,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2068 proven. 345 refuted. 0 times theorem prover too weak. 2838 trivial. 0 not checked. [2018-11-07 22:15:00,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2068 proven. 345 refuted. 0 times theorem prover too weak. 2838 trivial. 0 not checked. [2018-11-07 22:15:01,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:01,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 18, 18] total 79 [2018-11-07 22:15:01,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:01,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 22:15:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 22:15:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:15:01,383 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand 63 states. [2018-11-07 22:15:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:01,746 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2018-11-07 22:15:01,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 22:15:01,747 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 188 [2018-11-07 22:15:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:01,749 INFO L225 Difference]: With dead ends: 248 [2018-11-07 22:15:01,749 INFO L226 Difference]: Without dead ends: 196 [2018-11-07 22:15:01,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:15:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-07 22:15:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-07 22:15:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 22:15:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2018-11-07 22:15:01,756 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 188 [2018-11-07 22:15:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:01,756 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2018-11-07 22:15:01,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 22:15:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2018-11-07 22:15:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 22:15:01,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:01,757 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 45, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:01,757 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:01,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:01,758 INFO L82 PathProgramCache]: Analyzing trace with hash -809845382, now seen corresponding path program 45 times [2018-11-07 22:15:01,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:01,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:01,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:02,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:02,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:02,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:02,789 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:02,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:02,789 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:15:02,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:02,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:02,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:02,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:02,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:02,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:03,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:03,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-11-07 22:15:03,955 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:03,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:15:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:15:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:03,956 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand 48 states. [2018-11-07 22:15:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:04,124 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-11-07 22:15:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:15:04,125 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 194 [2018-11-07 22:15:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:04,126 INFO L225 Difference]: With dead ends: 253 [2018-11-07 22:15:04,126 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 22:15:04,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 343 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 22:15:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-07 22:15:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 22:15:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-11-07 22:15:04,134 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 194 [2018-11-07 22:15:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:04,134 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-11-07 22:15:04,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:15:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-11-07 22:15:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 22:15:04,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:04,136 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 46, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:04,136 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:04,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1328361119, now seen corresponding path program 46 times [2018-11-07 22:15:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:04,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:04,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:05,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:05,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:05,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:05,179 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:05,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:05,179 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:15:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:05,186 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:05,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:05,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-11-07 22:15:06,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:06,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:15:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:15:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:06,246 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 49 states. [2018-11-07 22:15:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:06,436 INFO L93 Difference]: Finished difference Result 256 states and 289 transitions. [2018-11-07 22:15:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:15:06,436 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 197 [2018-11-07 22:15:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:06,438 INFO L225 Difference]: With dead ends: 256 [2018-11-07 22:15:06,438 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 22:15:06,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 348 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 22:15:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-07 22:15:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 22:15:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2018-11-07 22:15:06,444 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 197 [2018-11-07 22:15:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:06,444 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2018-11-07 22:15:06,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:15:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2018-11-07 22:15:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 22:15:06,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:06,445 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:06,445 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:06,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1978265434, now seen corresponding path program 47 times [2018-11-07 22:15:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:06,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:06,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 22:15:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:10,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:10,010 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:10,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:10,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:10,011 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:15:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:10,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:10,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 22:15:10,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:10,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2350 proven. 392 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2018-11-07 22:15:10,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2350 proven. 392 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2018-11-07 22:15:11,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:11,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 19, 19] total 84 [2018-11-07 22:15:11,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:11,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 22:15:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 22:15:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:15:11,790 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand 67 states. [2018-11-07 22:15:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:12,194 INFO L93 Difference]: Finished difference Result 263 states and 299 transitions. [2018-11-07 22:15:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 22:15:12,195 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 200 [2018-11-07 22:15:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:12,196 INFO L225 Difference]: With dead ends: 263 [2018-11-07 22:15:12,196 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 22:15:12,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:15:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 22:15:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-07 22:15:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 22:15:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-11-07 22:15:12,205 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 200 [2018-11-07 22:15:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:12,205 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-11-07 22:15:12,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 22:15:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-11-07 22:15:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 22:15:12,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:12,207 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 48, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:12,207 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:12,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash 709682108, now seen corresponding path program 48 times [2018-11-07 22:15:12,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:12,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:12,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:14,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:14,841 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:14,841 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:14,841 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:14,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:14,841 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:15:14,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:14,851 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:14,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:14,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:14,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:14,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-11-07 22:15:16,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:16,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:15:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:15:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:16,033 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 51 states. [2018-11-07 22:15:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:17,361 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2018-11-07 22:15:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 22:15:17,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 206 [2018-11-07 22:15:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:17,363 INFO L225 Difference]: With dead ends: 268 [2018-11-07 22:15:17,363 INFO L226 Difference]: Without dead ends: 210 [2018-11-07 22:15:17,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-07 22:15:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-07 22:15:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 22:15:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-11-07 22:15:17,374 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 206 [2018-11-07 22:15:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:17,375 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-11-07 22:15:17,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:15:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-11-07 22:15:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 22:15:17,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:17,382 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 49, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:17,383 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:17,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1569572193, now seen corresponding path program 49 times [2018-11-07 22:15:17,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:17,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:17,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:19,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:19,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:19,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:19,435 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:19,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:19,435 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:15:19,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:19,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:19,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:19,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 22:15:20,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:20,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-11-07 22:15:20,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:20,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 22:15:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 22:15:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:20,784 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 52 states. [2018-11-07 22:15:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:20,984 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-11-07 22:15:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 22:15:20,984 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 209 [2018-11-07 22:15:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:20,986 INFO L225 Difference]: With dead ends: 271 [2018-11-07 22:15:20,986 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 22:15:20,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 369 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 22:15:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-11-07 22:15:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-07 22:15:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 230 transitions. [2018-11-07 22:15:20,995 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 230 transitions. Word has length 209 [2018-11-07 22:15:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:20,995 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 230 transitions. [2018-11-07 22:15:20,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 22:15:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 230 transitions. [2018-11-07 22:15:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 22:15:20,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:20,997 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:20,997 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -924826212, now seen corresponding path program 50 times [2018-11-07 22:15:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:20,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2832 proven. 551 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:21,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:21,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:21,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:21,373 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:21,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:21,373 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:15:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:21,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:21,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 22:15:21,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:21,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2650 proven. 442 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:21,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2650 proven. 442 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2018-11-07 22:15:22,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:22,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:15:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:15:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:15:22,316 INFO L87 Difference]: Start difference. First operand 213 states and 230 transitions. Second operand 22 states. [2018-11-07 22:15:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:22,427 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-11-07 22:15:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:15:22,427 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 212 [2018-11-07 22:15:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:22,429 INFO L225 Difference]: With dead ends: 228 [2018-11-07 22:15:22,429 INFO L226 Difference]: Without dead ends: 223 [2018-11-07 22:15:22,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:15:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-07 22:15:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-11-07 22:15:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 22:15:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-11-07 22:15:22,436 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 212 [2018-11-07 22:15:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-11-07 22:15:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:15:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-11-07 22:15:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 22:15:22,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:22,438 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:22,438 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:22,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 890030239, now seen corresponding path program 51 times [2018-11-07 22:15:22,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:22,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:22,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 3264 proven. 737 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:22,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:22,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:22,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:22,811 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:22,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:22,811 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:15:22,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:22,820 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:22,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:22,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:22,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:24,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:27,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:27,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 73, 73] total 102 [2018-11-07 22:15:27,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 22:15:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 22:15:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:27,150 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 75 states. [2018-11-07 22:15:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:27,571 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2018-11-07 22:15:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-07 22:15:27,572 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 221 [2018-11-07 22:15:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:27,573 INFO L225 Difference]: With dead ends: 237 [2018-11-07 22:15:27,573 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 22:15:27,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 322 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10292 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 22:15:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-11-07 22:15:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 22:15:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2018-11-07 22:15:27,580 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 221 [2018-11-07 22:15:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:27,580 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2018-11-07 22:15:27,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 22:15:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2018-11-07 22:15:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 22:15:27,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:27,582 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:27,582 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:27,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 740292860, now seen corresponding path program 52 times [2018-11-07 22:15:27,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:27,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:27,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3696 proven. 950 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:27,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:27,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:27,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:27,958 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:27,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:27,958 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:15:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:27,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:28,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:29,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:31,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 76, 76] total 102 [2018-11-07 22:15:31,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-07 22:15:31,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-07 22:15:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:31,536 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand 78 states. [2018-11-07 22:15:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:32,056 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-11-07 22:15:32,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-07 22:15:32,060 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 230 [2018-11-07 22:15:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:32,061 INFO L225 Difference]: With dead ends: 246 [2018-11-07 22:15:32,061 INFO L226 Difference]: Without dead ends: 241 [2018-11-07 22:15:32,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 337 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11027 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-07 22:15:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-11-07 22:15:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 22:15:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 266 transitions. [2018-11-07 22:15:32,070 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 266 transitions. Word has length 230 [2018-11-07 22:15:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:32,070 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 266 transitions. [2018-11-07 22:15:32,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-07 22:15:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 266 transitions. [2018-11-07 22:15:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 22:15:32,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:32,072 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:32,072 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:32,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -28253889, now seen corresponding path program 53 times [2018-11-07 22:15:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:32,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:32,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4128 proven. 1190 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:32,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:32,569 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:32,569 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:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:32,569 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:15:32,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:32,579 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:32,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 22:15:32,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:32,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4000 proven. 1027 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:32,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4000 proven. 1027 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:33,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:33,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 52 [2018-11-07 22:15:33,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:15:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:15:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:33,484 INFO L87 Difference]: Start difference. First operand 240 states and 266 transitions. Second operand 31 states. [2018-11-07 22:15:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:33,637 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2018-11-07 22:15:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:15:33,637 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 239 [2018-11-07 22:15:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:33,639 INFO L225 Difference]: With dead ends: 255 [2018-11-07 22:15:33,639 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 22:15:33,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 452 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 22:15:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-11-07 22:15:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 22:15:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 278 transitions. [2018-11-07 22:15:33,648 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 278 transitions. Word has length 239 [2018-11-07 22:15:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:33,648 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 278 transitions. [2018-11-07 22:15:33,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:15:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 278 transitions. [2018-11-07 22:15:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 22:15:33,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:33,650 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:33,650 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:33,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 534615132, now seen corresponding path program 54 times [2018-11-07 22:15:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:33,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:33,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4560 proven. 1457 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:34,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:34,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:34,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:34,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:34,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:34,429 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:15:34,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:34,437 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:34,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:34,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:34,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:35,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:37,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:37,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 82, 82] total 102 [2018-11-07 22:15:37,546 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:37,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-07 22:15:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-07 22:15:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:37,547 INFO L87 Difference]: Start difference. First operand 249 states and 278 transitions. Second operand 84 states. [2018-11-07 22:15:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:38,273 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2018-11-07 22:15:38,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 22:15:38,274 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 248 [2018-11-07 22:15:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:38,275 INFO L225 Difference]: With dead ends: 264 [2018-11-07 22:15:38,275 INFO L226 Difference]: Without dead ends: 259 [2018-11-07 22:15:38,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 367 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12497 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-07 22:15:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-11-07 22:15:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 22:15:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 290 transitions. [2018-11-07 22:15:38,284 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 290 transitions. Word has length 248 [2018-11-07 22:15:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:38,285 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 290 transitions. [2018-11-07 22:15:38,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-07 22:15:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 290 transitions. [2018-11-07 22:15:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 22:15:38,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:38,286 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 50, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:38,287 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:38,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 37491167, now seen corresponding path program 55 times [2018-11-07 22:15:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:38,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:38,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:38,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:38,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 4992 proven. 1751 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:38,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:38,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:38,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:38,894 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:38,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:38,894 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:15:38,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:38,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:38,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:40,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:42,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:42,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 85, 85] total 102 [2018-11-07 22:15:42,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:42,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-07 22:15:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-07 22:15:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:42,126 INFO L87 Difference]: Start difference. First operand 258 states and 290 transitions. Second operand 87 states. [2018-11-07 22:15:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:42,913 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2018-11-07 22:15:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-07 22:15:42,914 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 257 [2018-11-07 22:15:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:42,915 INFO L225 Difference]: With dead ends: 273 [2018-11-07 22:15:42,915 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 22:15:42,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 382 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13232 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 22:15:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-11-07 22:15:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-07 22:15:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2018-11-07 22:15:42,923 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 257 [2018-11-07 22:15:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:42,924 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2018-11-07 22:15:42,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-07 22:15:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2018-11-07 22:15:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-07 22:15:42,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:42,926 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 50, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:42,926 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:42,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -949020740, now seen corresponding path program 56 times [2018-11-07 22:15:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:42,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:42,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5424 proven. 2072 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:43,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:43,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:43,603 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:43,603 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:43,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:43,603 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:15:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:43,611 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:43,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 22:15:43,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:43,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5350 proven. 1855 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:43,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5350 proven. 1855 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:44,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:44,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 52 [2018-11-07 22:15:44,651 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:44,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:15:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:15:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:44,652 INFO L87 Difference]: Start difference. First operand 267 states and 302 transitions. Second operand 40 states. [2018-11-07 22:15:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:44,866 INFO L93 Difference]: Finished difference Result 282 states and 323 transitions. [2018-11-07 22:15:44,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:15:44,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 266 [2018-11-07 22:15:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:44,867 INFO L225 Difference]: With dead ends: 282 [2018-11-07 22:15:44,867 INFO L226 Difference]: Without dead ends: 277 [2018-11-07 22:15:44,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 497 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-07 22:15:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2018-11-07 22:15:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-07 22:15:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 314 transitions. [2018-11-07 22:15:44,876 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 314 transitions. Word has length 266 [2018-11-07 22:15:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:44,877 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 314 transitions. [2018-11-07 22:15:44,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:15:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 314 transitions. [2018-11-07 22:15:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 22:15:44,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:44,879 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 50, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:44,879 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:44,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2117622399, now seen corresponding path program 57 times [2018-11-07 22:15:44,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:44,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:44,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:44,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:44,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 5856 proven. 2420 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:46,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:46,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:46,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:46,046 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:46,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:46,046 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:15:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:46,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:46,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:46,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:46,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:47,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:49,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:49,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 91, 91] total 102 [2018-11-07 22:15:49,096 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:49,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 22:15:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 22:15:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:49,098 INFO L87 Difference]: Start difference. First operand 276 states and 314 transitions. Second operand 93 states. [2018-11-07 22:15:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:49,956 INFO L93 Difference]: Finished difference Result 291 states and 335 transitions. [2018-11-07 22:15:49,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-07 22:15:49,956 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 275 [2018-11-07 22:15:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:49,958 INFO L225 Difference]: With dead ends: 291 [2018-11-07 22:15:49,958 INFO L226 Difference]: Without dead ends: 286 [2018-11-07 22:15:49,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 412 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14702 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-07 22:15:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-11-07 22:15:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-07 22:15:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2018-11-07 22:15:49,966 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 275 [2018-11-07 22:15:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:49,967 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2018-11-07 22:15:49,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 22:15:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2018-11-07 22:15:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-07 22:15:49,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:49,969 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:49,969 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:49,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1554678556, now seen corresponding path program 58 times [2018-11-07 22:15:49,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:49,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:49,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 6288 proven. 2795 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:51,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:51,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:51,130 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:51,130 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:51,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:51,130 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:15:51,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:51,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:51,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:52,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:54,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94, 94] total 102 [2018-11-07 22:15:54,041 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:54,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-07 22:15:54,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-07 22:15:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:54,042 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand 96 states. [2018-11-07 22:15:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:55,046 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2018-11-07 22:15:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-07 22:15:55,047 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 284 [2018-11-07 22:15:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:55,048 INFO L225 Difference]: With dead ends: 300 [2018-11-07 22:15:55,049 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 22:15:55,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 427 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15437 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:15:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 22:15:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2018-11-07 22:15:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 22:15:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 338 transitions. [2018-11-07 22:15:55,055 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 338 transitions. Word has length 284 [2018-11-07 22:15:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:55,055 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 338 transitions. [2018-11-07 22:15:55,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-07 22:15:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 338 transitions. [2018-11-07 22:15:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 22:15:55,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:55,057 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 50, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:55,057 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:55,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash -382747873, now seen corresponding path program 59 times [2018-11-07 22:15:55,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:55,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:55,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6720 proven. 3197 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:56,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:56,384 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:56,384 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:56,384 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:56,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:56,384 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:15:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:56,394 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:56,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-11-07 22:15:56,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:56,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6700 proven. 2926 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:56,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6700 proven. 2926 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 22:15:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47, 47] total 52 [2018-11-07 22:15:57,539 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:57,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:15:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:15:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:57,540 INFO L87 Difference]: Start difference. First operand 294 states and 338 transitions. Second operand 49 states. [2018-11-07 22:15:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:57,907 INFO L93 Difference]: Finished difference Result 309 states and 359 transitions. [2018-11-07 22:15:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:15:57,907 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 293 [2018-11-07 22:15:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:57,908 INFO L225 Difference]: With dead ends: 309 [2018-11-07 22:15:57,908 INFO L226 Difference]: Without dead ends: 304 [2018-11-07 22:15:57,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 542 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:15:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-07 22:15:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-11-07 22:15:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-07 22:15:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 350 transitions. [2018-11-07 22:15:57,915 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 350 transitions. Word has length 293 [2018-11-07 22:15:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:57,916 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 350 transitions. [2018-11-07 22:15:57,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:15:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2018-11-07 22:15:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 22:15:57,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:57,917 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:57,917 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:57,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1880762756, now seen corresponding path program 60 times [2018-11-07 22:15:57,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:57,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:57,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:57,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:57,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 7152 proven. 3626 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 22:15:58,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:58,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:58,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:58,997 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:58,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:58,997 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:15:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:59,006 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:59,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:59,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:59,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:16:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:16:00,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:16:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:16:02,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:16:02,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100, 100] total 102 [2018-11-07 22:16:02,407 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:16:02,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-07 22:16:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-07 22:16:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:16:02,409 INFO L87 Difference]: Start difference. First operand 303 states and 350 transitions. Second operand 102 states. [2018-11-07 22:16:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:16:03,632 INFO L93 Difference]: Finished difference Result 317 states and 369 transitions. [2018-11-07 22:16:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-07 22:16:03,632 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 302 [2018-11-07 22:16:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:16:03,634 INFO L225 Difference]: With dead ends: 317 [2018-11-07 22:16:03,634 INFO L226 Difference]: Without dead ends: 312 [2018-11-07 22:16:03,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 457 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:16:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-07 22:16:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-07 22:16:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-07 22:16:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 362 transitions. [2018-11-07 22:16:03,642 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 362 transitions. Word has length 302 [2018-11-07 22:16:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:16:03,643 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 362 transitions. [2018-11-07 22:16:03,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-07 22:16:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 362 transitions. [2018-11-07 22:16:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-07 22:16:03,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:16:03,645 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:16:03,645 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:16:03,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:16:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1819528257, now seen corresponding path program 61 times [2018-11-07 22:16:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:16:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:03,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:16:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:03,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:16:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 22:16:06,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:06,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:16:06,175 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:16:06,176 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:16:06,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:06,176 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:16:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:16:06,184 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:16:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:06,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:16:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 22:16:06,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:16:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 22:16:07,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:16:07,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2018-11-07 22:16:07,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:16:07,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 22:16:07,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 22:16:07,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:16:07,170 INFO L87 Difference]: Start difference. First operand 312 states and 362 transitions. Second operand 55 states. [2018-11-07 22:16:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:16:09,207 INFO L93 Difference]: Finished difference Result 4294 states and 5669 transitions. [2018-11-07 22:16:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:16:09,207 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 311 [2018-11-07 22:16:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:16:09,227 INFO L225 Difference]: With dead ends: 4294 [2018-11-07 22:16:09,227 INFO L226 Difference]: Without dead ends: 4289 [2018-11-07 22:16:09,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 616 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:16:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2018-11-07 22:16:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 315. [2018-11-07 22:16:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-07 22:16:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 366 transitions. [2018-11-07 22:16:09,307 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 366 transitions. Word has length 311 [2018-11-07 22:16:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:16:09,307 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 366 transitions. [2018-11-07 22:16:09,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 22:16:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 366 transitions. [2018-11-07 22:16:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 22:16:09,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:16:09,310 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:16:09,310 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:16:09,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:16:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 908591292, now seen corresponding path program 62 times [2018-11-07 22:16:09,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:16:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:09,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:16:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:09,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:16:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 11527 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 22:16:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:16:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-07 22:16:11,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:16:11,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 22:16:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 22:16:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:16:11,022 INFO L87 Difference]: Start difference. First operand 315 states and 366 transitions. Second operand 52 states. [2018-11-07 22:16:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:16:11,323 INFO L93 Difference]: Finished difference Result 464 states and 564 transitions. [2018-11-07 22:16:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 22:16:11,324 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 314 [2018-11-07 22:16:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:16:11,325 INFO L225 Difference]: With dead ends: 464 [2018-11-07 22:16:11,325 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:16:11,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:16:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:16:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:16:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:16:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:16:11,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 314 [2018-11-07 22:16:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:16:11,327 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:16:11,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 22:16:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:16:11,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:16:11,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:16:12,228 WARN L179 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 1837 DAG size of output: 407 [2018-11-07 22:16:15,900 WARN L179 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-11-07 22:16:15,918 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:16:15,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:16:15,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:16:15,918 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:16:15,918 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:16:15,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:16:15,919 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-07 22:16:15,919 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-07 22:16:15,919 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-07 22:16:15,919 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-11-07 22:16:15,919 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-07 22:16:15,919 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 20) no Hoare annotation was computed. [2018-11-07 22:16:15,921 INFO L421 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (and (<= main_~x~0 99) (<= 99 main_~y~0) (<= main_~y~0 99)) (<= 99 main_~x~0)) (and (and (<= main_~y~0 92) (<= 92 main_~y~0) (<= main_~x~0 92)) (<= 92 main_~x~0)) (and (<= 65 main_~x~0) (and (<= main_~y~0 65) (<= 65 main_~y~0) (<= main_~x~0 65))) (and (and (<= main_~y~0 100) (< 99 main_~y~0)) (<= 100 main_~x~0)) (and (<= 64 main_~x~0) (and (<= main_~x~0 64) (<= 64 main_~y~0) (<= main_~y~0 64))) (and (<= 76 main_~x~0) (and (<= main_~y~0 76) (<= main_~x~0 76) (<= 76 main_~y~0))) (and (<= 87 main_~x~0) (and (<= main_~x~0 87) (<= main_~y~0 87) (<= 87 main_~y~0))) (and (and (<= main_~y~0 78) (<= 78 main_~y~0) (<= main_~x~0 78)) (<= 78 main_~x~0)) (and (<= 72 main_~x~0) (and (<= main_~y~0 72) (<= main_~x~0 72) (<= 72 main_~y~0))) (and (and (<= main_~y~0 69) (<= 69 main_~y~0) (<= main_~x~0 69)) (<= 69 main_~x~0)) (and (<= 60 main_~x~0) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~y~0))) (and (<= 67 main_~x~0) (and (<= main_~y~0 67) (<= main_~x~0 67) (<= 67 main_~y~0))) (and (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55)) (<= 55 main_~x~0)) (and (and (<= 73 main_~y~0) (<= main_~x~0 73) (<= main_~y~0 73)) (<= 73 main_~x~0)) (and (<= 66 main_~x~0) (and (<= main_~y~0 66) (<= 66 main_~y~0) (<= main_~x~0 66))) (and (and (<= main_~x~0 70) (<= main_~y~0 70) (<= 70 main_~y~0)) (<= 70 main_~x~0)) (and (and (<= main_~x~0 95) (<= main_~y~0 95) (<= 95 main_~y~0)) (<= 95 main_~x~0)) (and (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= main_~x~0 90)) (<= 90 main_~x~0)) (and (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~y~0)) (<= 59 main_~x~0)) (and (<= 85 main_~x~0) (and (<= 85 main_~y~0) (<= main_~x~0 85) (<= main_~y~0 85))) (and (<= 63 main_~x~0) (and (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0))) (and (and (<= main_~y~0 77) (<= main_~x~0 77) (<= 77 main_~y~0)) (<= 77 main_~x~0)) (and (<= 53 main_~x~0) (and (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0))) (and (and (<= main_~x~0 79) (<= main_~y~0 79) (<= 79 main_~y~0)) (<= 79 main_~x~0)) (and (<= 68 main_~x~0) (and (<= 68 main_~y~0) (<= main_~y~0 68) (<= main_~x~0 68))) (and (<= 51 main_~x~0) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= main_~y~0 51))) (and (<= 54 main_~x~0) (and (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54))) (and (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56)) (<= 56 main_~x~0)) (and (<= 61 main_~x~0) (and (<= main_~y~0 61) (<= 61 main_~y~0) (<= main_~x~0 61))) (and (<= 88 main_~x~0) (and (<= main_~x~0 88) (<= main_~y~0 88) (<= 88 main_~y~0))) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and (<= 80 main_~x~0) (and (<= main_~x~0 80) (<= 80 main_~y~0) (<= main_~y~0 80))) (and (<= 94 main_~x~0) (and (<= main_~x~0 94) (<= main_~y~0 94) (<= 94 main_~y~0))) (and (<= 89 main_~x~0) (and (<= 89 main_~y~0) (<= main_~y~0 89) (<= main_~x~0 89))) (and (and (<= 86 main_~y~0) (<= main_~x~0 86) (<= main_~y~0 86)) (<= 86 main_~x~0)) (and (<= 58 main_~x~0) (and (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0))) (and (and (<= main_~x~0 91) (<= 91 main_~y~0) (<= main_~y~0 91)) (<= 91 main_~x~0)) (and (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52)) (<= 52 main_~x~0)) (and (<= 93 main_~x~0) (and (<= main_~x~0 93) (<= 93 main_~y~0) (<= main_~y~0 93))) (and (<= 74 main_~x~0) (and (<= 74 main_~y~0) (<= main_~y~0 74) (<= main_~x~0 74))) (and (and (<= main_~y~0 71) (<= main_~x~0 71) (<= 71 main_~y~0)) (<= 71 main_~x~0)) (and (<= 57 main_~x~0) (and (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57))) (and (<= 97 main_~x~0) (and (<= 97 main_~y~0) (<= main_~x~0 97) (<= main_~y~0 97))) (and (and (<= main_~x~0 81) (<= 81 main_~y~0) (<= main_~y~0 81)) (<= 81 main_~x~0)) (and (<= 84 main_~x~0) (and (<= main_~y~0 84) (<= 84 main_~y~0) (<= main_~x~0 84))) (and (and (<= 96 main_~y~0) (<= main_~x~0 96) (<= main_~y~0 96)) (<= 96 main_~x~0)) (and (<= 83 main_~x~0) (and (<= main_~y~0 83) (<= 83 main_~y~0) (<= main_~x~0 83))) (and (<= 62 main_~x~0) (and (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0))) (and (and (<= main_~x~0 98) (<= main_~y~0 98) (<= 98 main_~y~0)) (<= 98 main_~x~0)) (and (and (<= 75 main_~y~0) (<= main_~x~0 75) (<= main_~y~0 75)) (<= 75 main_~x~0)) (and (and (<= 82 main_~y~0) (<= main_~y~0 82) (<= main_~x~0 82)) (<= 82 main_~x~0))) [2018-11-07 22:16:15,922 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0)) [2018-11-07 22:16:15,922 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:16:15,922 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:16:15,922 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:16:15,922 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:16:15,922 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:16:15,923 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:16:15,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:16:15 BoogieIcfgContainer [2018-11-07 22:16:15,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:16:15,958 INFO L168 Benchmark]: Toolchain (without parser) took 147411.00 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -909.4 MB). Peak memory consumption was 872.8 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:15,958 INFO L168 Benchmark]: CDTParser took 0.26 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:16:15,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.81 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:16:15,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.00 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:16:15,960 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 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:16:15,961 INFO L168 Benchmark]: RCFGBuilder took 397.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:15,961 INFO L168 Benchmark]: TraceAbstraction took 146668.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 263.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -127.5 MB). Peak memory consumption was 905.5 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:15,967 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.26 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 298.81 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 19.00 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 22.15 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 397.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146668.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 263.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -127.5 MB). Peak memory consumption was 905.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 99 && 99 <= y) && y <= 99) && 99 <= x) || (((y <= 92 && 92 <= y) && x <= 92) && 92 <= x)) || (65 <= x && (y <= 65 && 65 <= y) && x <= 65)) || ((y <= 100 && 99 < y) && 100 <= x)) || (64 <= x && (x <= 64 && 64 <= y) && y <= 64)) || (76 <= x && (y <= 76 && x <= 76) && 76 <= y)) || (87 <= x && (x <= 87 && y <= 87) && 87 <= y)) || (((y <= 78 && 78 <= y) && x <= 78) && 78 <= x)) || (72 <= x && (y <= 72 && x <= 72) && 72 <= y)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (67 <= x && (y <= 67 && x <= 67) && 67 <= y)) || (((y <= 55 && 55 <= y) && x <= 55) && 55 <= x)) || (((73 <= y && x <= 73) && y <= 73) && 73 <= x)) || (66 <= x && (y <= 66 && 66 <= y) && x <= 66)) || (((x <= 70 && y <= 70) && 70 <= y) && 70 <= x)) || (((x <= 95 && y <= 95) && 95 <= y) && 95 <= x)) || (((90 <= y && y <= 90) && x <= 90) && 90 <= x)) || (((y <= 59 && x <= 59) && 59 <= y) && 59 <= x)) || (85 <= x && (85 <= y && x <= 85) && y <= 85)) || (63 <= x && (y <= 63 && x <= 63) && 63 <= y)) || (((y <= 77 && x <= 77) && 77 <= y) && 77 <= x)) || (53 <= x && (y <= 53 && x <= 53) && 53 <= y)) || (((x <= 79 && y <= 79) && 79 <= y) && 79 <= x)) || (68 <= x && (68 <= y && y <= 68) && x <= 68)) || (51 <= x && (51 <= y && x <= 51) && y <= 51)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((56 <= y && x <= 56) && y <= 56) && 56 <= x)) || (61 <= x && (y <= 61 && 61 <= y) && x <= 61)) || (88 <= x && (x <= 88 && y <= 88) && 88 <= y)) || ((y <= 50 && x <= 50) && 50 <= y)) || (80 <= x && (x <= 80 && 80 <= y) && y <= 80)) || (94 <= x && (x <= 94 && y <= 94) && 94 <= y)) || (89 <= x && (89 <= y && y <= 89) && x <= 89)) || (((86 <= y && x <= 86) && y <= 86) && 86 <= x)) || (58 <= x && (x <= 58 && y <= 58) && 58 <= y)) || (((x <= 91 && 91 <= y) && y <= 91) && 91 <= x)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (93 <= x && (x <= 93 && 93 <= y) && y <= 93)) || (74 <= x && (74 <= y && y <= 74) && x <= 74)) || (((y <= 71 && x <= 71) && 71 <= y) && 71 <= x)) || (57 <= x && (57 <= y && x <= 57) && y <= 57)) || (97 <= x && (97 <= y && x <= 97) && y <= 97)) || (((x <= 81 && 81 <= y) && y <= 81) && 81 <= x)) || (84 <= x && (y <= 84 && 84 <= y) && x <= 84)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (83 <= x && (y <= 83 && 83 <= y) && x <= 83)) || (62 <= x && (y <= 62 && x <= 62) && 62 <= y)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((75 <= y && x <= 75) && y <= 75) && 75 <= x)) || (((82 <= y && y <= 82) && x <= 82) && 82 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 146.5s OverallTime, 65 OverallIterations, 102 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 958 SDtfs, 1348 SDslu, 18538 SDs, 0 SdLazy, 9435 SolverSat, 2379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 19194 GetRequests, 15189 SyntacticMatches, 1015 SemanticMatches, 2990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106812 ImplicationChecksByTransitivity, 107.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.3076923076923077 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 65 MinimizatonAttempts, 4003 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 71 PreInvPairs, 173 NumberOfFragments, 720 HoareAnnotationTreeSize, 71 FomulaSimplifications, 14805 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 113.3s InterpolantComputationTime, 17699 NumberOfCodeBlocks, 16355 NumberOfCodeBlocksAsserted, 548 NumberOfCheckSat, 26187 ConstructedInterpolants, 0 QuantifiedInterpolants, 12342997 SizeOfPredicates, 49 NumberOfNonLiveVariables, 14311 ConjunctsInSsa, 1919 ConjunctsInUnsatCore, 187 InterpolantComputations, 3 PerfectInterpolantSequences, 368759/735027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...