java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:47,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:47,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:47,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:47,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:47,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:47,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:47,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:47,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:47,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:47,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:47,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:47,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:47,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:47,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:47,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:47,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:47,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:47,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:47,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:47,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:47,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:47,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:47,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:47,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:47,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:47,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:47,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:47,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:47,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:47,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:47,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:47,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:47,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:47,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:47,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:47,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:47,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:47,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:47,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:47,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:47,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:52:47,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:47,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:47,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:47,874 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:47,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:47,875 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:47,875 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:47,875 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:47,875 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:47,876 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:47,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:47,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:47,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:47,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:47,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:47,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:47,878 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:47,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:47,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:47,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:47,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:47,879 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:47,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:47,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:47,880 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:47,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:47,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:47,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:47,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:47,925 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:47,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-03 20:52:47,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad31cc/427aa3169c974310aebce06ea49d59ee/FLAG3b0359108 [2019-09-03 20:52:48,437 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:48,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-03 20:52:48,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad31cc/427aa3169c974310aebce06ea49d59ee/FLAG3b0359108 [2019-09-03 20:52:48,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad31cc/427aa3169c974310aebce06ea49d59ee [2019-09-03 20:52:48,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:48,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:48,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:48,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:48,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:48,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:48" (1/1) ... [2019-09-03 20:52:48,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17114e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:48, skipping insertion in model container [2019-09-03 20:52:48,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:48" (1/1) ... [2019-09-03 20:52:48,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:48,897 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:49,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:49,086 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:49,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:49,149 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:49,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49 WrapperNode [2019-09-03 20:52:49,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:49,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:49,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:49,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:49,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (1/1) ... [2019-09-03 20:52:49,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:49,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:49,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:49,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:49,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (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 [2019-09-03 20:52:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:49,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:49,654 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:52:49,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:49 BoogieIcfgContainer [2019-09-03 20:52:49,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:49,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:49,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:49,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:49,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:48" (1/3) ... [2019-09-03 20:52:49,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590490ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:49, skipping insertion in model container [2019-09-03 20:52:49,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:49" (2/3) ... [2019-09-03 20:52:49,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590490ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:49, skipping insertion in model container [2019-09-03 20:52:49,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:49" (3/3) ... [2019-09-03 20:52:49,664 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-09-03 20:52:49,674 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:49,682 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:49,698 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:49,725 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:49,725 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:49,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:49,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:49,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:49,726 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:49,726 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:49,726 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-03 20:52:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:49,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:49,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:49,751 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-09-03 20:52:49,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:52:49,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:49,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:52:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:52:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:52:49,956 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-03 20:52:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,160 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-09-03 20:52:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:52:50,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-03 20:52:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,174 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:52:50,174 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:52:50,176 INFO L628 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 [2019-09-03 20:52:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:52:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 20:52:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:52:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-09-03 20:52:50,228 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-09-03 20:52:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,229 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-09-03 20:52:50,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:52:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-09-03 20:52:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:50,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,232 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-09-03 20:52:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:50,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:50,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:50,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:50,316 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2019-09-03 20:52:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,433 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-03 20:52:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:50,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-03 20:52:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,436 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:52:50,436 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:52:50,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:52:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:52:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:52:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-03 20:52:50,449 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-03 20:52:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,450 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-03 20:52:50,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-03 20:52:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:50,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,452 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2019-09-03 20:52:50,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:50,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:50,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:50,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:50,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:50,578 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2019-09-03 20:52:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,705 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-09-03 20:52:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:50,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-03 20:52:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,708 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:52:50,708 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:52:50,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:52:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 20:52:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:52:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-03 20:52:50,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-09-03 20:52:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,721 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-03 20:52:50,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-03 20:52:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:50,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,724 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2019-09-03 20:52:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-03 20:52:50,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:50,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:52:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:52:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:50,891 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2019-09-03 20:52:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:51,004 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 20:52:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:51,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 20:52:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:51,005 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:52:51,006 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:52:51,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:52:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:52:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:52:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 20:52:51,011 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2019-09-03 20:52:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:51,012 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 20:52:51,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:52:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 20:52:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:51,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:51,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:51,013 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2019-09-03 20:52:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:51,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:51,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:52:51,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:51,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:52:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:52:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:52:51,044 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2019-09-03 20:52:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:51,092 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-03 20:52:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:52:51,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-03 20:52:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:51,094 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:52:51,094 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:52:51,094 INFO L628 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 [2019-09-03 20:52:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:52:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:52:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:52:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 20:52:51,098 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-03 20:52:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:51,099 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 20:52:51,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:52:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 20:52:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:51,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:51,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:51,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2019-09-03 20:52:51,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:51,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:51,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-03 20:52:51,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:51,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:51,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:51,201 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-03 20:52:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:51,276 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-03 20:52:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:51,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-03 20:52:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:51,278 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:52:51,278 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:52:51,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:52:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:52:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:52:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 20:52:51,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-09-03 20:52:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:51,282 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 20:52:51,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 20:52:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:52:51,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:51,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:51,284 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2019-09-03 20:52:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:51,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:51,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-03 20:52:51,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:51,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:51,424 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-03 20:52:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:51,551 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-03 20:52:51,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:51,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-03 20:52:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:51,552 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:52:51,553 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:52:51,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:52:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:52:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:52:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-03 20:52:51,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-03 20:52:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:51,557 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-03 20:52:51,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-03 20:52:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:52:51,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:51,558 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:51,558 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-09-03 20:52:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:51,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-03 20:52:51,726 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [77], [79], [82], [83], [114], [115], [116] [2019-09-03 20:52:51,773 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:51,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:51,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:51,895 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 6 different actions 17 times. Widened at 2 different actions 3 times. Performed 115 root evaluator evaluations with a maximum evaluation depth of 4. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2019-09-03 20:52:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:51,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,900 INFO L193 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 [2019-09-03 20:52:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:51,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:51,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:52,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:52:52,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:52,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:52,266 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2019-09-03 20:52:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:52,385 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-03 20:52:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:52,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-03 20:52:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:52,386 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:52:52,386 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:52:52,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:52:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:52:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:52:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-03 20:52:52,391 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-09-03 20:52:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:52,391 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-03 20:52:52,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-03 20:52:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:52:52,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:52,392 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:52,393 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2019-09-03 20:52:52,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:52,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:52,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:52,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:52,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,535 INFO L193 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 [2019-09-03 20:52:52,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:52,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:52,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:52,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:52,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:52,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:52,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:53,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:53,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2019-09-03 20:52:53,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:53,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:53,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:53,212 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 26 states. [2019-09-03 20:52:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:53,363 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-03 20:52:53,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:52:53,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-09-03 20:52:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:53,365 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:53,365 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:52:53,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:52:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-03 20:52:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:52:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-03 20:52:53,371 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 33 [2019-09-03 20:52:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:53,371 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-03 20:52:53,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-03 20:52:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 20:52:53,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:53,372 INFO L399 BasicCegarLoop]: trace histogram [15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:53,373 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1917273006, now seen corresponding path program 3 times [2019-09-03 20:52:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:53,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:53,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:53,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:53,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,548 INFO L193 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) [2019-09-03 20:52:53,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:53,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:53,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:53,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:53,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:53,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:53,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:53,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:53,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-03 20:52:53,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:53,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:53,857 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 15 states. [2019-09-03 20:52:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:53,982 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-03 20:52:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:53,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-09-03 20:52:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:53,984 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:52:53,984 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:52:53,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:52:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-03 20:52:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:52:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-03 20:52:53,990 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-09-03 20:52:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:53,990 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-03 20:52:53,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-03 20:52:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-03 20:52:53,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:53,992 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:53,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 798282511, now seen corresponding path program 4 times [2019-09-03 20:52:53,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:54,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:54,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:54,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:54,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,128 INFO L193 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 [2019-09-03 20:52:54,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:54,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:52:54,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:54,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:54,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-03 20:52:54,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:54,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:52:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:52:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:54,567 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 16 states. [2019-09-03 20:52:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,714 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-03 20:52:54,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:52:54,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-09-03 20:52:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,716 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:52:54,716 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:52:54,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:52:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-03 20:52:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:52:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-03 20:52:54,725 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-09-03 20:52:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,725 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-03 20:52:54,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:52:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-03 20:52:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:52:54,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,727 INFO L399 BasicCegarLoop]: trace histogram [17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,727 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash -892981620, now seen corresponding path program 5 times [2019-09-03 20:52:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:54,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:54,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:54,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:54,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,911 INFO L193 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 [2019-09-03 20:52:54,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:54,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:54,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:52:54,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:54,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:54,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:55,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:55,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-03 20:52:55,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:55,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:55,316 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 17 states. [2019-09-03 20:52:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:55,447 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-09-03 20:52:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:55,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-03 20:52:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:55,448 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:52:55,449 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:52:55,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:52:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 20:52:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:52:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-03 20:52:55,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-09-03 20:52:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:55,454 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-03 20:52:55,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-03 20:52:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:52:55,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:55,456 INFO L399 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:55,456 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1594793673, now seen corresponding path program 6 times [2019-09-03 20:52:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:55,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:55,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:55,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:55,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,627 INFO L193 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 [2019-09-03 20:52:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:55,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:55,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:55,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:55,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:52:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:55,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:56,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-03 20:52:56,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:56,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:56,020 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 18 states. [2019-09-03 20:52:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:56,160 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-03 20:52:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:52:56,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-09-03 20:52:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:56,161 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:52:56,162 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:52:56,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:52:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-03 20:52:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:52:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-03 20:52:56,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-09-03 20:52:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:56,166 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-03 20:52:56,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-03 20:52:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:52:56,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:56,168 INFO L399 BasicCegarLoop]: trace histogram [19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:56,168 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 50066374, now seen corresponding path program 7 times [2019-09-03 20:52:56,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:56,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:56,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:56,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:56,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,332 INFO L193 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 [2019-09-03 20:52:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:56,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:56,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:56,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:56,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:56,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-03 20:52:56,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:56,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:56,789 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 19 states. [2019-09-03 20:52:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:56,929 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-09-03 20:52:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:56,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-09-03 20:52:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:56,931 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:52:56,931 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:52:56,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:52:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-03 20:52:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:52:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-03 20:52:56,937 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-09-03 20:52:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:56,938 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-03 20:52:56,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-03 20:52:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 20:52:56,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:56,939 INFO L399 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:56,940 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1625816451, now seen corresponding path program 8 times [2019-09-03 20:52:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:57,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:57,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:57,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:57,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,146 INFO L193 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 [2019-09-03 20:52:57,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:57,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:57,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 20:52:57,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:57,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:52:57,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:57,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:57,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:57,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-03 20:52:57,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:57,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:52:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:52:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:57,614 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2019-09-03 20:52:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,722 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-09-03 20:52:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:52:57,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-09-03 20:52:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,724 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:52:57,724 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:52:57,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:52:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-03 20:52:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-03 20:52:57,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-09-03 20:52:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,730 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-03 20:52:57,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:52:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-03 20:52:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:52:57,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,731 INFO L399 BasicCegarLoop]: trace histogram [21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:57,731 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash -201815040, now seen corresponding path program 9 times [2019-09-03 20:52:57,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:57,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:57,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:57,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:57,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,931 INFO L193 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 [2019-09-03 20:52:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:57,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:57,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:57,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:57,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:58,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:58,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:58,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-03 20:52:58,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:58,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:58,434 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2019-09-03 20:52:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:58,559 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-03 20:52:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:58,560 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-03 20:52:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:58,560 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:52:58,560 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:52:58,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:52:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 20:52:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:52:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-03 20:52:58,565 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-09-03 20:52:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:58,565 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-03 20:52:58,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-03 20:52:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-03 20:52:58,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:58,566 INFO L399 BasicCegarLoop]: trace histogram [22, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:58,567 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 85946173, now seen corresponding path program 10 times [2019-09-03 20:52:58,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:58,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:58,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:58,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,781 INFO L193 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 [2019-09-03 20:52:58,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:58,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:58,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-03 20:52:59,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:59,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:52:59,379 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2019-09-03 20:52:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:59,514 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-03 20:52:59,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:52:59,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2019-09-03 20:52:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:59,515 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:52:59,516 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:52:59,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:52:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:52:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-03 20:52:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:52:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-03 20:52:59,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-09-03 20:52:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:59,520 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-03 20:52:59,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-03 20:52:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 20:52:59,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:59,522 INFO L399 BasicCegarLoop]: trace histogram [23, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:59,522 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1746564922, now seen corresponding path program 11 times [2019-09-03 20:52:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:59,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:59,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:59,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:59,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:59,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:59,809 INFO L193 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) [2019-09-03 20:52:59,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:59,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:59,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:52:59,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:59,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:59,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:52:59,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:00,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:00,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-03 20:53:00,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:00,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:53:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:53:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:00,628 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2019-09-03 20:53:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:00,747 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-09-03 20:53:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:53:00,747 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-09-03 20:53:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:00,748 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:53:00,748 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:53:00,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:53:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-03 20:53:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:53:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-03 20:53:00,753 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2019-09-03 20:53:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:00,753 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-03 20:53:00,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:53:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-03 20:53:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:53:00,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:00,754 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:00,755 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -126651401, now seen corresponding path program 12 times [2019-09-03 20:53:00,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:00,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:00,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,990 INFO L193 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 [2019-09-03 20:53:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:01,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:01,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:01,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:01,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:53:01,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:01,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-03 20:53:01,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:01,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:53:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:53:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:01,617 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2019-09-03 20:53:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:01,770 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-09-03 20:53:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:53:01,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-03 20:53:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:01,771 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:53:01,771 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:53:01,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:53:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-03 20:53:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 20:53:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-03 20:53:01,777 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-09-03 20:53:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:01,777 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-03 20:53:01,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:53:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-03 20:53:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:53:01,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:01,779 INFO L399 BasicCegarLoop]: trace histogram [25, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:01,779 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash -696240780, now seen corresponding path program 13 times [2019-09-03 20:53:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:02,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:02,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:02,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:02,045 INFO L193 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 [2019-09-03 20:53:02,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:02,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:02,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:02,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:02,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-03 20:53:02,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:02,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:53:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:53:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:53:02,691 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2019-09-03 20:53:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:02,848 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-03 20:53:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:53:02,849 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-03 20:53:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:02,850 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:53:02,850 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:53:02,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:53:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:53:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 20:53:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:53:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 20:53:02,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-09-03 20:53:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:02,855 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 20:53:02,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:53:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 20:53:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:53:02,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:02,856 INFO L399 BasicCegarLoop]: trace histogram [26, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:02,856 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179889, now seen corresponding path program 14 times [2019-09-03 20:53:02,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:02,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 345 proven. 210 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:03,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:03,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:03,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:03,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:03,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:03,129 INFO L193 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 [2019-09-03 20:53:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:03,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:03,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:53:03,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:03,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:53:03,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 20:53:03,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 20:53:03,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:03,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 52 [2019-09-03 20:53:03,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:03,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:03,841 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2019-09-03 20:53:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,054 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-09-03 20:53:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:04,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2019-09-03 20:53:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,055 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:53:04,055 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:53:04,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:53:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-03 20:53:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 20:53:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-03 20:53:04,059 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-09-03 20:53:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,059 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-03 20:53:04,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-03 20:53:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:53:04,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,061 INFO L399 BasicCegarLoop]: trace histogram [28, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,061 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764232, now seen corresponding path program 15 times [2019-09-03 20:53:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,392 INFO L193 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 [2019-09-03 20:53:04,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:04,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:04,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:04,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:04,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:04,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-03 20:53:05,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:53:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:53:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:05,114 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 27 states. [2019-09-03 20:53:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,298 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-09-03 20:53:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:53:05,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-09-03 20:53:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,308 INFO L225 Difference]: With dead ends: 86 [2019-09-03 20:53:05,308 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 20:53:05,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 20:53:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-03 20:53:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 20:53:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-03 20:53:05,312 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-09-03 20:53:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,312 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-03 20:53:05,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:53:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-03 20:53:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 20:53:05,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,313 INFO L399 BasicCegarLoop]: trace histogram [29, 16, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,314 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1891909893, now seen corresponding path program 16 times [2019-09-03 20:53:05,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:05,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:05,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:05,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,723 INFO L193 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) [2019-09-03 20:53:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:05,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:06,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-03 20:53:06,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:06,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:06,645 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2019-09-03 20:53:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:06,920 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-09-03 20:53:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:06,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2019-09-03 20:53:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:06,921 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:53:06,921 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:53:06,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:53:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 20:53:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:53:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-03 20:53:06,925 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-09-03 20:53:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:06,926 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-03 20:53:06,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-03 20:53:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:53:06,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:06,927 INFO L399 BasicCegarLoop]: trace histogram [30, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:06,927 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1312754242, now seen corresponding path program 17 times [2019-09-03 20:53:06,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 306 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:07,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:07,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:07,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:07,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,357 INFO L193 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 [2019-09-03 20:53:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:07,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:07,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 20:53:07,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:07,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:53:07,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 20:53:07,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 20:53:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 16] total 57 [2019-09-03 20:53:08,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:08,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:53:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:53:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:53:08,254 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 43 states. [2019-09-03 20:53:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:08,477 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-09-03 20:53:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:08,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2019-09-03 20:53:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:08,479 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:53:08,479 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:53:08,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:53:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:53:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-03 20:53:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 20:53:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-09-03 20:53:08,483 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2019-09-03 20:53:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:08,483 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-09-03 20:53:08,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:53:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-09-03 20:53:08,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 20:53:08,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:08,484 INFO L399 BasicCegarLoop]: trace histogram [32, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:08,484 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1585208793, now seen corresponding path program 18 times [2019-09-03 20:53:08,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:08,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:08,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,935 INFO L193 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) [2019-09-03 20:53:08,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:08,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:09,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:09,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:09,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:53:09,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:09,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:09,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:09,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-03 20:53:09,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:09,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:53:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:53:09,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:09,854 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 30 states. [2019-09-03 20:53:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,982 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-09-03 20:53:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:53:09,982 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-03 20:53:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,983 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:53:09,983 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:53:09,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:53:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-03 20:53:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 20:53:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-03 20:53:09,987 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-09-03 20:53:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,988 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-03 20:53:09,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:53:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-03 20:53:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 20:53:09,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,989 INFO L399 BasicCegarLoop]: trace histogram [33, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,989 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 400065878, now seen corresponding path program 19 times [2019-09-03 20:53:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:10,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:10,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:10,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:10,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,386 INFO L193 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 [2019-09-03 20:53:10,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:10,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:53:10,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:10,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-03 20:53:11,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:53:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:53:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:11,211 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2019-09-03 20:53:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:11,357 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-09-03 20:53:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:53:11,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-09-03 20:53:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:11,359 INFO L225 Difference]: With dead ends: 96 [2019-09-03 20:53:11,359 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:53:11,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:53:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 20:53:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:53:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-03 20:53:11,363 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-09-03 20:53:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:11,363 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-03 20:53:11,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:53:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-03 20:53:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-03 20:53:11,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:11,364 INFO L399 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:11,364 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash -355941997, now seen corresponding path program 20 times [2019-09-03 20:53:11,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:11,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 567 proven. 420 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:11,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:11,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:11,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:11,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,771 INFO L193 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 [2019-09-03 20:53:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:11,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:11,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:53:11,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:11,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:53:11,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 20:53:12,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 20:53:12,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:12,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 17] total 62 [2019-09-03 20:53:12,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:12,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:53:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:53:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:53:12,765 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 47 states. [2019-09-03 20:53:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:12,996 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-09-03 20:53:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:12,997 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 95 [2019-09-03 20:53:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:12,997 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:53:12,998 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:53:12,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:53:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:53:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-03 20:53:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-03 20:53:13,000 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2019-09-03 20:53:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,001 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-03 20:53:13,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:53:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-03 20:53:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-03 20:53:13,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,001 INFO L399 BasicCegarLoop]: trace histogram [36, 21, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,002 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2030471190, now seen corresponding path program 21 times [2019-09-03 20:53:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:13,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:13,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:13,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:13,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:13,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:13,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:13,423 INFO L193 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 [2019-09-03 20:53:13,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:13,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:13,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:13,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:13,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:53:13,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:13,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:14,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:14,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-03 20:53:14,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:14,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:14,296 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 33 states. [2019-09-03 20:53:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:14,462 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-09-03 20:53:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:53:14,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2019-09-03 20:53:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:14,463 INFO L225 Difference]: With dead ends: 102 [2019-09-03 20:53:14,463 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 20:53:14,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 20:53:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-03 20:53:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 20:53:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-03 20:53:14,466 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-03 20:53:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:14,466 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-03 20:53:14,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-03 20:53:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 20:53:14,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:14,467 INFO L399 BasicCegarLoop]: trace histogram [37, 22, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:14,467 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash -156708249, now seen corresponding path program 22 times [2019-09-03 20:53:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:14,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:14,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,902 INFO L193 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 [2019-09-03 20:53:14,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:14,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:14,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:16,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:16,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-03 20:53:16,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:16,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:16,056 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2019-09-03 20:53:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:16,214 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-09-03 20:53:16,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:53:16,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2019-09-03 20:53:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:16,215 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:53:16,216 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:53:16,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:53:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 20:53:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:53:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-03 20:53:16,221 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-09-03 20:53:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:16,221 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-03 20:53:16,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-03 20:53:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 20:53:16,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:16,222 INFO L399 BasicCegarLoop]: trace histogram [38, 23, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:16,223 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 938181028, now seen corresponding path program 23 times [2019-09-03 20:53:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 696 proven. 552 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:16,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:16,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:16,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:16,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,674 INFO L193 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 [2019-09-03 20:53:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:16,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:16,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:53:16,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:16,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:53:16,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 20:53:17,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:17,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:17,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18, 18] total 67 [2019-09-03 20:53:17,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:17,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:53:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:53:17,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:53:17,871 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 51 states. [2019-09-03 20:53:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:18,143 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-09-03 20:53:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:53:18,143 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 103 [2019-09-03 20:53:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:18,144 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:53:18,145 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:53:18,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:53:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:53:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-03 20:53:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 20:53:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-09-03 20:53:18,150 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2019-09-03 20:53:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:18,151 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-09-03 20:53:18,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:53:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-09-03 20:53:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 20:53:18,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:18,152 INFO L399 BasicCegarLoop]: trace histogram [40, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:18,152 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1615686331, now seen corresponding path program 24 times [2019-09-03 20:53:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:18,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:18,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:18,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:18,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,680 INFO L193 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 [2019-09-03 20:53:18,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:18,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:18,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:18,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:18,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:53:18,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:18,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-03 20:53:19,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:19,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:53:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:53:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:19,545 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 36 states. [2019-09-03 20:53:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:19,774 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-09-03 20:53:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:53:19,774 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2019-09-03 20:53:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:19,776 INFO L225 Difference]: With dead ends: 110 [2019-09-03 20:53:19,776 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:53:19,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:53:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-03 20:53:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-03 20:53:19,781 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2019-09-03 20:53:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:19,782 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-03 20:53:19,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:53:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-03 20:53:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 20:53:19,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:19,783 INFO L399 BasicCegarLoop]: trace histogram [41, 25, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:19,784 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 627898424, now seen corresponding path program 25 times [2019-09-03 20:53:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:19,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:20,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:20,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:20,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:20,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:20,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:20,643 INFO L193 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) [2019-09-03 20:53:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:20,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:20,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:53:20,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:20,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:21,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:21,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-03 20:53:21,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:21,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:53:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:53:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:21,611 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 37 states. [2019-09-03 20:53:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:21,800 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-09-03 20:53:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:21,800 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2019-09-03 20:53:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:21,801 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:53:21,801 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:53:21,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 184 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:53:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 20:53:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:53:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 20:53:21,806 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-03 20:53:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:21,806 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 20:53:21,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:53:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 20:53:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 20:53:21,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:21,807 INFO L399 BasicCegarLoop]: trace histogram [42, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:21,807 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 551492213, now seen corresponding path program 26 times [2019-09-03 20:53:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:21,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 837 proven. 702 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:22,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:22,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:22,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:22,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:22,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:22,379 INFO L193 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 [2019-09-03 20:53:22,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:22,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:22,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 20:53:22,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:22,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:53:22,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 20:53:22,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:23,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:23,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19, 19] total 72 [2019-09-03 20:53:23,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:23,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:53:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:53:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:53:23,692 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 55 states. [2019-09-03 20:53:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:23,960 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-09-03 20:53:23,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:53:23,960 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2019-09-03 20:53:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:23,962 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:53:23,962 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 20:53:23,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:53:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 20:53:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-03 20:53:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:53:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-09-03 20:53:23,967 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 111 [2019-09-03 20:53:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:23,967 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-09-03 20:53:23,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:53:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-09-03 20:53:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 20:53:23,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:23,968 INFO L399 BasicCegarLoop]: trace histogram [44, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:23,968 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 972817996, now seen corresponding path program 27 times [2019-09-03 20:53:23,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:24,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:24,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:24,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:24,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,609 INFO L193 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 [2019-09-03 20:53:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:24,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:24,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:24,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:24,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:53:24,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:24,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:25,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:25,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-03 20:53:25,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:25,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:25,513 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 39 states. [2019-09-03 20:53:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:25,708 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-09-03 20:53:25,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:25,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2019-09-03 20:53:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:25,710 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:53:25,710 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:53:25,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:53:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 20:53:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 20:53:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-03 20:53:25,713 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2019-09-03 20:53:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:25,714 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-03 20:53:25,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-03 20:53:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:53:25,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:25,715 INFO L399 BasicCegarLoop]: trace histogram [45, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:25,715 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2035759415, now seen corresponding path program 28 times [2019-09-03 20:53:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:26,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:26,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:26,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:26,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,307 INFO L193 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 [2019-09-03 20:53:26,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:26,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:26,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:53:26,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:26,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:27,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:27,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-03 20:53:27,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:27,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:27,201 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 40 states. [2019-09-03 20:53:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:27,396 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-09-03 20:53:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:53:27,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-03 20:53:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:27,398 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:53:27,398 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:53:27,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 197 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:53:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 20:53:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-03 20:53:27,402 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-09-03 20:53:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:27,402 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-03 20:53:27,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-03 20:53:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 20:53:27,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:27,404 INFO L399 BasicCegarLoop]: trace histogram [46, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:27,404 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1529306118, now seen corresponding path program 29 times [2019-09-03 20:53:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 990 proven. 870 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:28,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:28,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:28,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:28,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,065 INFO L193 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 [2019-09-03 20:53:28,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:28,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:28,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:53:28,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:28,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 20:53:28,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:29,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:29,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 77 [2019-09-03 20:53:29,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:29,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:53:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:53:29,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:53:29,573 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 59 states. [2019-09-03 20:53:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:29,857 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-09-03 20:53:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:53:29,858 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 119 [2019-09-03 20:53:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:29,859 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:53:29,859 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 20:53:29,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:53:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 20:53:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-03 20:53:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 20:53:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-09-03 20:53:29,864 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2019-09-03 20:53:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:29,865 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-09-03 20:53:29,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:53:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-09-03 20:53:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-03 20:53:29,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:29,866 INFO L399 BasicCegarLoop]: trace histogram [48, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:29,866 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -892003683, now seen corresponding path program 30 times [2019-09-03 20:53:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:29,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:29,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:30,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:30,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:30,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:30,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:30,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:30,750 INFO L193 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) [2019-09-03 20:53:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:30,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:30,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:30,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:53:30,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:30,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:31,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:31,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-03 20:53:31,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:31,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:53:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:53:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:31,864 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 42 states. [2019-09-03 20:53:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:32,053 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2019-09-03 20:53:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:53:32,054 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 123 [2019-09-03 20:53:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:32,055 INFO L225 Difference]: With dead ends: 126 [2019-09-03 20:53:32,055 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 20:53:32,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 207 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 20:53:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-09-03 20:53:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 20:53:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-03 20:53:32,060 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-09-03 20:53:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:32,063 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-03 20:53:32,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:53:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-03 20:53:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 20:53:32,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:32,065 INFO L399 BasicCegarLoop]: trace histogram [49, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:32,065 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1680608794, now seen corresponding path program 31 times [2019-09-03 20:53:32,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:32,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:32,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:32,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:32,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:32,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:32,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:32,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:32,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:32,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:32,770 INFO L193 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 [2019-09-03 20:53:32,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:32,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:32,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:53:32,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:32,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:33,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:33,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-03 20:53:33,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:33,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:53:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:53:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:33,680 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 43 states. [2019-09-03 20:53:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:33,902 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-09-03 20:53:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:33,903 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2019-09-03 20:53:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:33,904 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:53:33,904 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:53:33,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:53:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 20:53:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:53:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 20:53:33,908 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-09-03 20:53:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:33,908 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 20:53:33,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:53:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 20:53:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:53:33,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:33,909 INFO L399 BasicCegarLoop]: trace histogram [50, 32, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:33,910 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 60036695, now seen corresponding path program 32 times [2019-09-03 20:53:33,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:33,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:33,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1155 proven. 1056 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:53:34,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:34,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:34,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:34,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:34,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:34,748 INFO L193 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 [2019-09-03 20:53:34,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:34,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:34,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 20:53:34,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:34,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:53:34,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 20:53:35,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 20:53:36,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:36,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 82 [2019-09-03 20:53:36,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:36,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:53:36,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:53:36,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:53:36,429 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 63 states. [2019-09-03 20:53:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:36,700 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-09-03 20:53:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:53:36,701 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 127 [2019-09-03 20:53:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:36,702 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:53:36,702 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:53:36,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:53:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:53:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-03 20:53:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 20:53:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-09-03 20:53:36,706 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2019-09-03 20:53:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:36,706 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-09-03 20:53:36,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:53:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-09-03 20:53:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-03 20:53:36,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:36,708 INFO L399 BasicCegarLoop]: trace histogram [52, 33, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:36,708 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1913358418, now seen corresponding path program 33 times [2019-09-03 20:53:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:37,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:37,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:37,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,547 INFO L193 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 [2019-09-03 20:53:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:37,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:37,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:37,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:37,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:53:37,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:37,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:38,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:38,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-03 20:53:38,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:38,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:53:38,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:53:38,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:38,483 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2019-09-03 20:53:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:38,686 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-09-03 20:53:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:53:38,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2019-09-03 20:53:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:38,688 INFO L225 Difference]: With dead ends: 134 [2019-09-03 20:53:38,688 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 20:53:38,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 20:53:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-03 20:53:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 20:53:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-03 20:53:38,693 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-09-03 20:53:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:38,693 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-03 20:53:38,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:53:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-03 20:53:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 20:53:38,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:38,694 INFO L399 BasicCegarLoop]: trace histogram [53, 34, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:38,695 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash -871195093, now seen corresponding path program 34 times [2019-09-03 20:53:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:39,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:39,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:39,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:39,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:39,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:39,452 INFO L193 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 [2019-09-03 20:53:39,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:39,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:39,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:53:39,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:39,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-03 20:53:40,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:53:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:53:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:40,582 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 46 states. [2019-09-03 20:53:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:40,803 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-09-03 20:53:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:53:40,804 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-09-03 20:53:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:40,805 INFO L225 Difference]: With dead ends: 136 [2019-09-03 20:53:40,806 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:53:40,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:53:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-03 20:53:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:53:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-03 20:53:40,810 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2019-09-03 20:53:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:40,810 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-03 20:53:40,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:53:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-03 20:53:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-03 20:53:40,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:40,811 INFO L399 BasicCegarLoop]: trace histogram [54, 35, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:40,811 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -79619736, now seen corresponding path program 35 times [2019-09-03 20:53:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:53:41,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:41,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:41,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:41,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:41,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:41,612 INFO L193 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 [2019-09-03 20:53:41,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:41,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:41,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 20:53:41,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:41,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:41,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 20:53:42,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 20:53:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:43,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22, 22] total 87 [2019-09-03 20:53:43,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:43,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:53:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:53:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:53:43,401 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 67 states. [2019-09-03 20:53:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:43,758 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-09-03 20:53:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:53:43,759 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 135 [2019-09-03 20:53:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:43,760 INFO L225 Difference]: With dead ends: 141 [2019-09-03 20:53:43,760 INFO L226 Difference]: Without dead ends: 141 [2019-09-03 20:53:43,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:53:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-03 20:53:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-03 20:53:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:53:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-09-03 20:53:43,764 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2019-09-03 20:53:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:43,764 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-09-03 20:53:43,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:53:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-09-03 20:53:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-03 20:53:43,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:43,766 INFO L399 BasicCegarLoop]: trace histogram [56, 36, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:43,766 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -540938881, now seen corresponding path program 36 times [2019-09-03 20:53:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:44,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:44,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:44,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:44,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:44,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:44,575 INFO L193 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 [2019-09-03 20:53:44,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:44,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:44,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:44,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:44,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:53:44,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:44,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:45,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:45,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-03 20:53:45,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:45,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:53:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:53:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:45,558 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 48 states. [2019-09-03 20:53:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:45,784 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-09-03 20:53:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:53:45,785 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-09-03 20:53:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:45,786 INFO L225 Difference]: With dead ends: 142 [2019-09-03 20:53:45,786 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 20:53:45,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 20:53:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-09-03 20:53:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 20:53:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-03 20:53:45,790 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2019-09-03 20:53:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:45,791 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-03 20:53:45,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:53:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-03 20:53:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 20:53:45,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:45,792 INFO L399 BasicCegarLoop]: trace histogram [57, 37, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:45,792 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1379645700, now seen corresponding path program 37 times [2019-09-03 20:53:45,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:45,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:45,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:46,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:46,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:46,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:46,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:46,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:46,688 INFO L193 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 [2019-09-03 20:53:46,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:46,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:53:46,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:46,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:48,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:48,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-03 20:53:48,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:48,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:53:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:53:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:48,026 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 49 states. [2019-09-03 20:53:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:48,259 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2019-09-03 20:53:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:48,259 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2019-09-03 20:53:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:48,260 INFO L225 Difference]: With dead ends: 144 [2019-09-03 20:53:48,260 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:53:48,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 236 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:53:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 20:53:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 20:53:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 20:53:48,264 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-09-03 20:53:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:48,264 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 20:53:48,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:53:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 20:53:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:48,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:48,266 INFO L399 BasicCegarLoop]: trace histogram [58, 38, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:48,266 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash 76952889, now seen corresponding path program 38 times [2019-09-03 20:53:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1521 proven. 1482 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:53:49,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:49,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,351 INFO L193 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 [2019-09-03 20:53:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:49,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:49,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:53:49,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:49,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:53:49,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 20:53:50,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 20:53:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:51,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 92 [2019-09-03 20:53:51,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:51,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:53:51,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:53:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:53:51,400 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 71 states. [2019-09-03 20:53:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:51,752 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-09-03 20:53:51,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:53:51,753 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2019-09-03 20:53:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:51,754 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:53:51,754 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:53:51,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:53:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:53:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-03 20:53:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 20:53:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-03 20:53:51,759 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2019-09-03 20:53:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:51,759 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-03 20:53:51,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:53:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-03 20:53:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 20:53:51,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:51,760 INFO L399 BasicCegarLoop]: trace histogram [60, 39, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:51,761 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash -621720560, now seen corresponding path program 39 times [2019-09-03 20:53:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:52,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:52,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:52,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:52,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,716 INFO L193 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 [2019-09-03 20:53:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:52,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:52,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:52,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:52,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:53:52,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:52,792 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:53,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-03 20:53:53,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:53,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:53:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:53:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:53,704 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 51 states. [2019-09-03 20:53:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:53,953 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-09-03 20:53:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:53:53,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2019-09-03 20:53:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:53,956 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:53:53,956 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:53:53,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:53:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-03 20:53:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:53:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-03 20:53:53,959 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-09-03 20:53:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:53,960 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-03 20:53:53,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:53:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-03 20:53:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:53:53,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:53,961 INFO L399 BasicCegarLoop]: trace histogram [61, 40, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:53,961 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1225467763, now seen corresponding path program 40 times [2019-09-03 20:53:53,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:54,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:54,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,929 INFO L193 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 [2019-09-03 20:53:54,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:54,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:53:54,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:54,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:53:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-03 20:53:55,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:55,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:53:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:53:55,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:55,875 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 52 states. [2019-09-03 20:53:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:56,090 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-09-03 20:53:56,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:53:56,090 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 149 [2019-09-03 20:53:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:56,091 INFO L225 Difference]: With dead ends: 152 [2019-09-03 20:53:56,091 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:53:56,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:53:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-03 20:53:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 20:53:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-03 20:53:56,094 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-09-03 20:53:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:56,094 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-03 20:53:56,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:53:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-03 20:53:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 20:53:56,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:56,095 INFO L399 BasicCegarLoop]: trace histogram [62, 41, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:56,095 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 41 times [2019-09-03 20:53:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:57,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:57,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:57,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:57,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:57,979 INFO L193 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 [2019-09-03 20:53:57,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:57,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:58,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 20:53:58,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:58,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:58,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:53:58,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:53:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-03 20:53:59,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:59,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:53:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:53:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:53:59,311 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 74 states. [2019-09-03 20:53:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:59,732 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-09-03 20:53:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:53:59,732 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-03 20:53:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:59,733 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:53:59,733 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:53:59,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:53:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:53:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 20:53:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:53:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-03 20:53:59,737 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 151 [2019-09-03 20:53:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:59,738 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-03 20:53:59,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:53:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-03 20:53:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 20:53:59,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:59,739 INFO L399 BasicCegarLoop]: trace histogram [63, 41, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:59,739 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1427314524, now seen corresponding path program 42 times [2019-09-03 20:53:59,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:59,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:59,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:59,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:01,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:01,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:01,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:01,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:01,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:01,676 INFO L193 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 [2019-09-03 20:54:01,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:01,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:01,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:01,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:01,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:01,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:01,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:04,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-03 20:54:04,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:04,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:54:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:54:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:04,860 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 75 states. [2019-09-03 20:54:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:05,202 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-09-03 20:54:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:54:05,203 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-03 20:54:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:05,204 INFO L225 Difference]: With dead ends: 157 [2019-09-03 20:54:05,204 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 20:54:05,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 20:54:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-03 20:54:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 20:54:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-09-03 20:54:05,209 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-09-03 20:54:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:05,209 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-09-03 20:54:05,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:54:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-09-03 20:54:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-03 20:54:05,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:05,210 INFO L399 BasicCegarLoop]: trace histogram [64, 41, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:05,210 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1562228482, now seen corresponding path program 43 times [2019-09-03 20:54:05,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:05,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:05,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:07,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:07,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:07,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:07,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,361 INFO L193 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 [2019-09-03 20:54:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:07,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:07,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 20:54:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:07,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-03 20:54:10,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:54:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:54:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:10,635 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 76 states. [2019-09-03 20:54:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:11,053 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-09-03 20:54:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:54:11,054 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-03 20:54:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:11,055 INFO L225 Difference]: With dead ends: 159 [2019-09-03 20:54:11,055 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 20:54:11,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 20:54:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-03 20:54:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 20:54:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-03 20:54:11,058 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-09-03 20:54:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:11,059 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-03 20:54:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:54:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-03 20:54:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 20:54:11,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:11,060 INFO L399 BasicCegarLoop]: trace histogram [65, 41, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:11,060 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 44 times [2019-09-03 20:54:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:11,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:13,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:13,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:13,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:13,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:13,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:13,140 INFO L193 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 [2019-09-03 20:54:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:13,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:13,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 20:54:13,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:13,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:54:13,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2009 proven. 576 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:13,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2009 proven. 576 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:14,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:14,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-03 20:54:14,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:14,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:54:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:54:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:14,717 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 77 states. [2019-09-03 20:54:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:15,116 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-09-03 20:54:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:54:15,117 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-03 20:54:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:15,119 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:54:15,119 INFO L226 Difference]: Without dead ends: 161 [2019-09-03 20:54:15,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-03 20:54:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-03 20:54:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:54:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 20:54:15,122 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-09-03 20:54:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:15,123 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 20:54:15,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:54:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 20:54:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 20:54:15,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:15,124 INFO L399 BasicCegarLoop]: trace histogram [66, 41, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:15,124 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1237672398, now seen corresponding path program 45 times [2019-09-03 20:54:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:15,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:15,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:17,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:17,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:17,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:17,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,153 INFO L193 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 [2019-09-03 20:54:17,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:17,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:17,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:17,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:17,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:54:17,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:17,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:20,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:20,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-03 20:54:20,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:20,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:54:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:54:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:20,466 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 78 states. [2019-09-03 20:54:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:20,883 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-09-03 20:54:20,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 20:54:20,884 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-03 20:54:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:20,888 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:54:20,888 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:54:20,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:54:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-03 20:54:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 20:54:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-03 20:54:20,891 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-09-03 20:54:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:20,892 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-03 20:54:20,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:54:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-03 20:54:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 20:54:20,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:20,893 INFO L399 BasicCegarLoop]: trace histogram [67, 41, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:20,893 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:20,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash 295228172, now seen corresponding path program 46 times [2019-09-03 20:54:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:24,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:24,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:24,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:24,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:24,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:24,803 INFO L193 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) [2019-09-03 20:54:24,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:24,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:24,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:54:24,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:24,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:28,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-03 20:54:28,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:54:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:54:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:28,071 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 79 states. [2019-09-03 20:54:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:28,474 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-09-03 20:54:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:54:28,474 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-03 20:54:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:28,475 INFO L225 Difference]: With dead ends: 165 [2019-09-03 20:54:28,475 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 20:54:28,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 20:54:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-03 20:54:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 20:54:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-09-03 20:54:28,479 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-09-03 20:54:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:28,479 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-09-03 20:54:28,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:54:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-09-03 20:54:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 20:54:28,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:28,480 INFO L399 BasicCegarLoop]: trace histogram [68, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:28,480 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:28,481 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 47 times [2019-09-03 20:54:28,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:28,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:30,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:30,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:30,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:30,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,703 INFO L193 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 [2019-09-03 20:54:30,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:30,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:30,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 20:54:30,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:30,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:30,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2255 proven. 729 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:30,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2255 proven. 729 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:32,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-03 20:54:32,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:32,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:54:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:54:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:32,421 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 80 states. [2019-09-03 20:54:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:32,848 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-09-03 20:54:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:54:32,849 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-03 20:54:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:32,850 INFO L225 Difference]: With dead ends: 167 [2019-09-03 20:54:32,850 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 20:54:32,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 299 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 20:54:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-03 20:54:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 20:54:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-03 20:54:32,854 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-09-03 20:54:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:32,855 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-03 20:54:32,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:54:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-03 20:54:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:54:32,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:32,856 INFO L399 BasicCegarLoop]: trace histogram [69, 41, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:32,856 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1935765824, now seen corresponding path program 48 times [2019-09-03 20:54:32,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:35,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:35,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:35,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:35,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,568 INFO L193 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 [2019-09-03 20:54:35,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:35,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:35,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:35,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:35,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:54:35,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:35,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:38,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-03 20:54:38,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:38,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:54:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:54:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:38,850 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 81 states. [2019-09-03 20:54:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:39,280 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-09-03 20:54:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:54:39,280 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-03 20:54:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:39,282 INFO L225 Difference]: With dead ends: 169 [2019-09-03 20:54:39,282 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 20:54:39,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 20:54:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-03 20:54:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 20:54:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-03 20:54:39,286 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-09-03 20:54:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:39,286 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-03 20:54:39,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:54:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-03 20:54:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 20:54:39,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:39,288 INFO L399 BasicCegarLoop]: trace histogram [70, 41, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:39,288 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 542579354, now seen corresponding path program 49 times [2019-09-03 20:54:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:39,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:39,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:41,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:41,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,505 INFO L193 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 [2019-09-03 20:54:41,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:41,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:41,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:54:41,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:41,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:44,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:44,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-03 20:54:44,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:44,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:54:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:54:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:44,824 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 82 states. [2019-09-03 20:54:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:45,277 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-09-03 20:54:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 20:54:45,277 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-03 20:54:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:45,278 INFO L225 Difference]: With dead ends: 171 [2019-09-03 20:54:45,278 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 20:54:45,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 20:54:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-03 20:54:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:54:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-03 20:54:45,282 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2019-09-03 20:54:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:45,282 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-03 20:54:45,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:54:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-03 20:54:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 20:54:45,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:45,284 INFO L399 BasicCegarLoop]: trace histogram [71, 41, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:45,284 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:45,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 50 times [2019-09-03 20:54:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:45,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:45,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:47,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:47,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:47,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:47,545 INFO L193 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 [2019-09-03 20:54:47,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:47,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:47,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-03 20:54:47,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:47,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:54:47,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:47,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:54:49,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:49,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-03 20:54:49,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:49,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:54:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:54:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:49,602 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 83 states. [2019-09-03 20:54:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:50,057 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-09-03 20:54:50,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:54:50,058 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-03 20:54:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:50,059 INFO L225 Difference]: With dead ends: 173 [2019-09-03 20:54:50,059 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:54:50,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 308 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:54:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-03 20:54:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 20:54:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-09-03 20:54:50,062 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 169 [2019-09-03 20:54:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:50,062 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2019-09-03 20:54:50,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:54:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2019-09-03 20:54:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 20:54:50,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:50,064 INFO L399 BasicCegarLoop]: trace histogram [72, 41, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:50,064 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash -478854706, now seen corresponding path program 51 times [2019-09-03 20:54:50,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:50,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:50,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:52,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:52,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:52,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:52,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,408 INFO L193 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 [2019-09-03 20:54:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:52,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:52,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:52,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:52,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:54:52,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:52,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:55,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:55,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-03 20:54:55,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:55,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:54:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:54:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:55,786 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 84 states. [2019-09-03 20:54:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:56,190 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-09-03 20:54:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:54:56,191 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-03 20:54:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:56,192 INFO L225 Difference]: With dead ends: 175 [2019-09-03 20:54:56,192 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 20:54:56,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 20:54:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-03 20:54:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 20:54:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-03 20:54:56,196 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2019-09-03 20:54:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:56,196 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-03 20:54:56,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:54:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-03 20:54:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:54:56,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:56,198 INFO L399 BasicCegarLoop]: trace histogram [73, 41, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:56,198 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:56,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -625410136, now seen corresponding path program 52 times [2019-09-03 20:54:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:56,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:56,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:58,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:58,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:58,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:58,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:58,570 INFO L193 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 [2019-09-03 20:54:58,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:58,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:58,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:54:58,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:58,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:01,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:01,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-03 20:55:01,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:01,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:55:01,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:55:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:01,999 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 85 states. [2019-09-03 20:55:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:02,464 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-09-03 20:55:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:55:02,464 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-03 20:55:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:02,466 INFO L225 Difference]: With dead ends: 177 [2019-09-03 20:55:02,466 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 20:55:02,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 20:55:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-03 20:55:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 20:55:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 20:55:02,470 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-09-03 20:55:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:02,470 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 20:55:02,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:55:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 20:55:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 20:55:02,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:02,471 INFO L399 BasicCegarLoop]: trace histogram [74, 41, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:02,471 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:02,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:02,472 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 53 times [2019-09-03 20:55:02,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:04,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:04,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:04,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:04,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,957 INFO L193 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 [2019-09-03 20:55:04,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:04,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:05,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-03 20:55:05,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:05,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:55:05,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2747 proven. 1089 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:05,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2747 proven. 1089 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:06,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:06,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-03 20:55:06,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:06,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:55:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:55:06,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:06,969 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 86 states. [2019-09-03 20:55:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:07,422 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-09-03 20:55:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 20:55:07,422 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-03 20:55:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:07,424 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:55:07,424 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:55:07,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 317 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:55:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-03 20:55:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 20:55:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-03 20:55:07,428 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-09-03 20:55:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:07,428 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-03 20:55:07,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:55:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-03 20:55:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 20:55:07,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:07,430 INFO L399 BasicCegarLoop]: trace histogram [75, 41, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:07,430 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash 555872220, now seen corresponding path program 54 times [2019-09-03 20:55:07,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:07,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:07,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:09,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:09,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:09,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:09,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:09,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:09,912 INFO L193 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 [2019-09-03 20:55:09,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:09,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:09,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:09,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:09,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:55:09,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:10,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-03 20:55:13,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:13,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:55:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:55:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:13,303 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 87 states. [2019-09-03 20:55:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,770 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-09-03 20:55:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:55:13,771 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-03 20:55:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,772 INFO L225 Difference]: With dead ends: 181 [2019-09-03 20:55:13,772 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 20:55:13,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 20:55:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-03 20:55:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:55:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-09-03 20:55:13,776 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2019-09-03 20:55:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,776 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-09-03 20:55:13,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:55:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-09-03 20:55:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-03 20:55:13,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,777 INFO L399 BasicCegarLoop]: trace histogram [76, 41, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,777 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1609720374, now seen corresponding path program 55 times [2019-09-03 20:55:13,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:16,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:16,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:16,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:16,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,360 INFO L193 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 [2019-09-03 20:55:16,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:16,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:16,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 20:55:16,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:16,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-03 20:55:19,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:19,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:55:19,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:55:19,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:19,745 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 88 states. [2019-09-03 20:55:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:20,182 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-09-03 20:55:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:55:20,182 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-03 20:55:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:20,184 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:55:20,184 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 20:55:20,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 20:55:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-03 20:55:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 20:55:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-03 20:55:20,188 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 179 [2019-09-03 20:55:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:20,188 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-03 20:55:20,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:55:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-03 20:55:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 20:55:20,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:20,190 INFO L399 BasicCegarLoop]: trace histogram [77, 41, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:20,190 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 56 times [2019-09-03 20:55:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:20,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:22,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:22,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:22,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:22,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:22,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:22,806 INFO L193 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 [2019-09-03 20:55:22,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:22,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:22,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-03 20:55:22,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:22,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:55:22,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1296 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:22,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1296 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:24,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:24,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-03 20:55:24,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:24,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:55:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:55:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:24,950 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 89 states. [2019-09-03 20:55:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:25,422 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-09-03 20:55:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:55:25,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-03 20:55:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:25,425 INFO L225 Difference]: With dead ends: 185 [2019-09-03 20:55:25,425 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:55:25,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 326 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:55:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-03 20:55:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 20:55:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 20:55:25,428 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-09-03 20:55:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:25,429 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 20:55:25,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:55:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 20:55:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 20:55:25,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:25,430 INFO L399 BasicCegarLoop]: trace histogram [78, 41, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:25,430 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 57 times [2019-09-03 20:55:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:25,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:25,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:28,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:28,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:28,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:28,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,154 INFO L193 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 [2019-09-03 20:55:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:28,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:28,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:28,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:55:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:28,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-03 20:55:31,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:31,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:55:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:55:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:31,556 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 90 states. [2019-09-03 20:55:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:31,988 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-09-03 20:55:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:55:31,988 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-03 20:55:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:31,990 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:55:31,990 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 20:55:31,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 20:55:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-03 20:55:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 20:55:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-03 20:55:31,993 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2019-09-03 20:55:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:31,993 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-03 20:55:31,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:55:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-03 20:55:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-03 20:55:31,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:31,994 INFO L399 BasicCegarLoop]: trace histogram [79, 41, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:31,995 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -791731644, now seen corresponding path program 58 times [2019-09-03 20:55:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:31,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:31,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:34,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:34,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,812 INFO L193 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 [2019-09-03 20:55:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:34,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:55:34,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:34,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:38,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:38,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-03 20:55:38,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:38,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:55:38,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:55:38,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:38,214 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 91 states. [2019-09-03 20:55:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:38,719 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-09-03 20:55:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:55:38,720 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-03 20:55:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:38,721 INFO L225 Difference]: With dead ends: 189 [2019-09-03 20:55:38,721 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 20:55:38,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 20:55:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-03 20:55:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 20:55:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-09-03 20:55:38,724 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 185 [2019-09-03 20:55:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:38,725 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-09-03 20:55:38,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:55:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-09-03 20:55:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 20:55:38,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:38,726 INFO L399 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:38,726 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 59 times [2019-09-03 20:55:38,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:38,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:38,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:41,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:41,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:41,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:41,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:41,518 INFO L193 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 [2019-09-03 20:55:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:41,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:41,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-03 20:55:41,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:41,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:55:41,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:41,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:55:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-03 20:55:43,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:43,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 20:55:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 20:55:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:43,791 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-09-03 20:55:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:44,328 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-09-03 20:55:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:55:44,329 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-03 20:55:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:44,329 INFO L225 Difference]: With dead ends: 191 [2019-09-03 20:55:44,330 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 20:55:44,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 335 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 20:55:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-03 20:55:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:55:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-03 20:55:44,332 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-09-03 20:55:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:44,333 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-03 20:55:44,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 20:55:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-03 20:55:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 20:55:44,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:44,334 INFO L399 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:44,334 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 60 times [2019-09-03 20:55:44,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:44,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:44,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:44,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:47,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:47,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:47,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:47,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:47,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:47,187 INFO L193 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 [2019-09-03 20:55:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:47,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:47,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:47,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:47,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:55:47,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:47,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:50,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-03 20:55:50,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:50,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:55:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:55:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:50,575 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-09-03 20:55:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:51,060 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-09-03 20:55:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:55:51,061 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-03 20:55:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:51,062 INFO L225 Difference]: With dead ends: 193 [2019-09-03 20:55:51,062 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 20:55:51,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 20:55:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-03 20:55:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 20:55:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 20:55:51,066 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-09-03 20:55:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:51,066 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 20:55:51,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:55:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 20:55:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 20:55:51,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:51,068 INFO L399 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:51,068 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 61 times [2019-09-03 20:55:51,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:53,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:53,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:53,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:53,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:53,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:53,995 INFO L193 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 [2019-09-03 20:55:54,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:54,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:54,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:55:54,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:54,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-03 20:55:57,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:57,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 20:55:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 20:55:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:57,419 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-09-03 20:55:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:57,895 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-09-03 20:55:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:55:57,895 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-03 20:55:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:57,897 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:55:57,897 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:55:57,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:55:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-03 20:55:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 20:55:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-03 20:55:57,901 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-09-03 20:55:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:57,901 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-03 20:55:57,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 20:55:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-03 20:55:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 20:55:57,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:57,903 INFO L399 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:57,903 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 62 times [2019-09-03 20:55:57,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:01,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:01,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:01,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:01,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-03 20:56:01,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:01,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:56:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:01,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:04,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:04,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-03 20:56:04,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:04,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:56:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:56:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:04,639 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-09-03 20:56:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:05,172 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-09-03 20:56:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:56:05,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-03 20:56:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:05,173 INFO L225 Difference]: With dead ends: 197 [2019-09-03 20:56:05,174 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 20:56:05,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 20:56:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-03 20:56:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 20:56:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-09-03 20:56:05,177 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-09-03 20:56:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:05,177 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-09-03 20:56:05,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:56:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-09-03 20:56:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-03 20:56:05,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:05,178 INFO L399 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:05,178 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 63 times [2019-09-03 20:56:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:05,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:05,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:08,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:08,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:08,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:08,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:08,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:08,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:08,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:08,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:08,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:08,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 20:56:08,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:08,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-03 20:56:11,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:11,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 20:56:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 20:56:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:11,591 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-09-03 20:56:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:12,113 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-09-03 20:56:12,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:56:12,114 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-03 20:56:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:12,115 INFO L225 Difference]: With dead ends: 199 [2019-09-03 20:56:12,115 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 20:56:12,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 20:56:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-03 20:56:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 20:56:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-03 20:56:12,119 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-09-03 20:56:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:12,120 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-03 20:56:12,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 20:56:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-03 20:56:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 20:56:12,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:12,121 INFO L399 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:12,121 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 64 times [2019-09-03 20:56:12,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:12,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:12,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:15,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:15,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:15,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:15,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:15,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:15,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:15,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:15,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:56:15,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:15,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:18,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-03 20:56:18,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:18,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:56:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:56:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:18,674 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-09-03 20:56:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:19,177 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-09-03 20:56:19,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:56:19,178 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-03 20:56:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:19,179 INFO L225 Difference]: With dead ends: 201 [2019-09-03 20:56:19,179 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 20:56:19,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 20:56:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-03 20:56:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:56:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 20:56:19,183 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-09-03 20:56:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:19,183 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 20:56:19,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:56:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 20:56:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 20:56:19,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:19,184 INFO L399 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:19,184 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 65 times [2019-09-03 20:56:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:22,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:22,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:22,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:22,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:22,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:22,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:22,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:22,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:22,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-09-03 20:56:22,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:22,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 20:56:22,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:22,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:25,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-03 20:56:25,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:25,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:56:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:56:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:25,900 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-09-03 20:56:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:26,404 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-09-03 20:56:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:56:26,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-03 20:56:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:26,406 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:56:26,406 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:56:26,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:56:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-03 20:56:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 20:56:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-03 20:56:26,410 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-09-03 20:56:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:26,411 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-03 20:56:26,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:56:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-03 20:56:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-03 20:56:26,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:26,412 INFO L399 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:26,412 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 66 times [2019-09-03 20:56:26,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:26,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:29,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:29,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:29,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:29,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:29,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:30,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:30,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:30,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:56:30,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:30,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:33,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:33,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-03 20:56:33,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:33,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:56:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:56:33,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:33,433 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-09-03 20:56:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:33,947 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-09-03 20:56:33,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:56:33,948 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-03 20:56:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:33,949 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:56:33,949 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:56:33,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:56:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-03 20:56:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-03 20:56:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-09-03 20:56:33,953 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-09-03 20:56:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:33,953 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-09-03 20:56:33,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:56:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-09-03 20:56:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-03 20:56:33,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:33,954 INFO L399 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:33,955 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 67 times [2019-09-03 20:56:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:33,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:33,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:37,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:37,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:37,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:37,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:37,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:37,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:37,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:37,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 20:56:37,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:37,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:40,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-03 20:56:40,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:40,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:56:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:56:40,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:40,654 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-09-03 20:56:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,203 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-09-03 20:56:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:56:41,203 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-03 20:56:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:41,204 INFO L225 Difference]: With dead ends: 207 [2019-09-03 20:56:41,204 INFO L226 Difference]: Without dead ends: 207 [2019-09-03 20:56:41,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-03 20:56:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-03 20:56:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 20:56:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-03 20:56:41,207 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-09-03 20:56:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:41,207 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-03 20:56:41,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:56:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-03 20:56:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 20:56:41,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:41,209 INFO L399 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:41,209 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 68 times [2019-09-03 20:56:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:44,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:44,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:44,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:44,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:44,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-03 20:56:44,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:44,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:48,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:48,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-03 20:56:48,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:48,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:56:48,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:56:48,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:48,107 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-09-03 20:56:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:48,611 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-09-03 20:56:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:56:48,611 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-03 20:56:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:48,613 INFO L225 Difference]: With dead ends: 209 [2019-09-03 20:56:48,613 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 20:56:48,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 20:56:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-03 20:56:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 20:56:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 20:56:48,617 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-09-03 20:56:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:48,617 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 20:56:48,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:56:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 20:56:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 20:56:48,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:48,618 INFO L399 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:48,618 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 69 times [2019-09-03 20:56:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:48,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:48,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:48,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:48,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:52,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:52,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:52,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:52,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:52,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:52,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:52,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:52,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:52,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:56:52,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:52,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:55,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:55,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-03 20:56:55,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:55,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:56:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:56:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:55,503 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-09-03 20:56:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:56,055 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-09-03 20:56:56,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 20:56:56,056 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-03 20:56:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:56,057 INFO L225 Difference]: With dead ends: 210 [2019-09-03 20:56:56,057 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:56:56,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:56:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-03 20:56:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 20:56:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-03 20:56:56,061 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-09-03 20:56:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:56,061 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-03 20:56:56,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:56:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-03 20:56:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-03 20:56:56,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:56,062 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:56,062 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 70 times [2019-09-03 20:56:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:56,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:56,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:56,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:56,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 20:56:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:58,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:58,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:58,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:58,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:56:58,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:58,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 20:56:58,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 20:56:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-03 20:56:58,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:58,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:56:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:56:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:56:58,485 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-09-03 20:57:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:00,371 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2019-09-03 20:57:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:57:00,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-03 20:57:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:00,373 INFO L225 Difference]: With dead ends: 214 [2019-09-03 20:57:00,373 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 20:57:00,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:57:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 20:57:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-03 20:57:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-03 20:57:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-09-03 20:57:00,376 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-09-03 20:57:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:00,376 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-09-03 20:57:00,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:57:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-09-03 20:57:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 20:57:00,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:00,378 INFO L399 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:00,378 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 71 times [2019-09-03 20:57:00,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 20:57:01,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:57:01,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 20:57:01,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:57:01,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:57:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:57:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:01,572 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-09-03 20:57:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:01,851 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-03 20:57:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:57:01,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-03 20:57:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:01,853 INFO L225 Difference]: With dead ends: 207 [2019-09-03 20:57:01,853 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:57:01,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:57:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:57:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:57:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:57:01,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-03 20:57:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:01,854 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:57:01,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:57:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:57:01,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:57:01,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:57:01 BoogieIcfgContainer [2019-09-03 20:57:01,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:57:01,861 INFO L168 Benchmark]: Toolchain (without parser) took 253005.28 ms. Allocated memory was 135.8 MB in the beginning and 478.2 MB in the end (delta: 342.4 MB). Free memory was 88.2 MB in the beginning and 338.9 MB in the end (delta: -250.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,862 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.35 ms. Allocated memory is still 135.8 MB. Free memory was 88.0 MB in the beginning and 76.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,863 INFO L168 Benchmark]: Boogie Preprocessor took 129.28 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 76.8 MB in the beginning and 177.8 MB in the end (delta: -101.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,863 INFO L168 Benchmark]: RCFGBuilder took 375.93 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 161.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,864 INFO L168 Benchmark]: TraceAbstraction took 252202.55 ms. Allocated memory was 200.8 MB in the beginning and 478.2 MB in the end (delta: 277.3 MB). Free memory was 160.9 MB in the beginning and 338.9 MB in the end (delta: -178.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:01,866 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.35 ms. Allocated memory is still 135.8 MB. Free memory was 88.0 MB in the beginning and 76.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.28 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 76.8 MB in the beginning and 177.8 MB in the end (delta: -101.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.93 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 161.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252202.55 ms. Allocated memory was 200.8 MB in the beginning and 478.2 MB in the end (delta: 277.3 MB). Free memory was 160.9 MB in the beginning and 338.9 MB in the end (delta: -178.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 252.1s OverallTime, 78 OverallIterations, 92 TraceHistogramMax, 24.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 887 SDtfs, 3733 SDslu, 20443 SDs, 0 SdLazy, 22178 SolverSat, 3573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22516 GetRequests, 15301 SyntacticMatches, 2196 SemanticMatches, 5019 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95103 ImplicationChecksByTransitivity, 213.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 78 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 219.2s InterpolantComputationTime, 18978 NumberOfCodeBlocks, 18662 NumberOfCodeBlocksAsserted, 1209 NumberOfCheckSat, 28048 ConstructedInterpolants, 0 QuantifiedInterpolants, 11277004 SizeOfPredicates, 59 NumberOfNonLiveVariables, 22348 ConjunctsInSsa, 3387 ConjunctsInUnsatCore, 218 InterpolantComputations, 8 PerfectInterpolantSequences, 188491/718694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...