java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:30:43,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:30:43,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:30:43,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:30:43,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:30:43,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:30:43,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:30:43,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:30:43,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:30:43,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:30:43,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:30:43,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:30:43,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:30:43,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:30:43,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:30:43,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:30:43,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:30:43,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:30:43,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:30:43,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:30:43,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:30:43,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:30:43,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:30:43,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:30:43,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:30:43,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:30:43,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:30:43,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:30:43,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:30:43,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:30:43,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:30:43,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:30:43,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:30:43,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:30:43,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:30:43,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:30:43,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:30:43,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:30:43,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:30:43,906 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:30:43,907 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:30:43,907 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:30:43,907 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:30:43,907 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:30:43,908 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:30:43,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:30:43,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:30:43,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:30:43,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:30:43,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:30:43,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:30:43,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:30:43,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:30:43,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:30:43,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:30:43,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:30:43,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:30:43,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:30:43,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:30:43,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:30:43,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:30:43,912 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:30:43,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:30:43,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:30:43,913 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:30:43,913 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:30:43,913 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:30:43,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:30:43,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:30:43,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:30:43,991 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:30:43,992 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:30:43,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-12 20:30:44,059 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894170d08/7a975cb9cec94c5e86e00b380390301a/FLAGf1d3a6691 [2018-11-12 20:30:44,499 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:30:44,500 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-12 20:30:44,507 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894170d08/7a975cb9cec94c5e86e00b380390301a/FLAGf1d3a6691 [2018-11-12 20:30:44,523 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894170d08/7a975cb9cec94c5e86e00b380390301a [2018-11-12 20:30:44,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:30:44,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:30:44,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:44,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:30:44,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:30:44,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7724b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44, skipping insertion in model container [2018-11-12 20:30:44,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:30:44,579 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:30:44,789 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:44,794 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:30:44,817 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:44,843 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:30:44,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44 WrapperNode [2018-11-12 20:30:44,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:44,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:44,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:30:44,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:30:44,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:44,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:30:44,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:30:44,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:30:44,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... [2018-11-12 20:30:44,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:30:44,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:30:44,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:30:44,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:30:44,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:30:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:30:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:30:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:30:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:30:45,456 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:30:45,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:45 BoogieIcfgContainer [2018-11-12 20:30:45,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:30:45,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:30:45,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:30:45,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:30:45,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:30:44" (1/3) ... [2018-11-12 20:30:45,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c903e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:45, skipping insertion in model container [2018-11-12 20:30:45,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:44" (2/3) ... [2018-11-12 20:30:45,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c903e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:45, skipping insertion in model container [2018-11-12 20:30:45,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:45" (3/3) ... [2018-11-12 20:30:45,465 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i [2018-11-12 20:30:45,476 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:30:45,484 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:30:45,501 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:30:45,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:30:45,538 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:30:45,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:30:45,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:30:45,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:30:45,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:30:45,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:30:45,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:30:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-12 20:30:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:30:45,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:45,567 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:45,570 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:45,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1097964223, now seen corresponding path program 1 times [2018-11-12 20:30:45,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:45,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:30:45,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:45,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:30:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:30:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:30:45,738 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-12 20:30:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:45,763 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-12 20:30:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:30:45,764 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-12 20:30:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:45,771 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:30:45,772 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:30:45,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:30:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:30:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:30:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:30:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-12 20:30:45,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-12 20:30:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:45,816 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-12 20:30:45,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:30:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-12 20:30:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:30:45,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:45,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:45,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:45,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1413574900, now seen corresponding path program 1 times [2018-11-12 20:30:45,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:45,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:45,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:30:45,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:45,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:30:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:30:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:45,905 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-12 20:30:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:45,998 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-12 20:30:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:30:45,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-12 20:30:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:46,001 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:30:46,001 INFO L226 Difference]: Without dead ends: 25 [2018-11-12 20:30:46,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-12 20:30:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-12 20:30:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:30:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-12 20:30:46,009 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2018-11-12 20:30:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:46,009 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-12 20:30:46,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:30:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-12 20:30:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:30:46,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:46,010 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:46,010 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:46,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1818930225, now seen corresponding path program 1 times [2018-11-12 20:30:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:46,144 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-12 20:30:46,146 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [38], [41], [43], [49], [50], [51], [53] [2018-11-12 20:30:46,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:46,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:46,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:46,596 INFO L272 AbstractInterpreter]: Visited 17 different actions 41 times. Merged at 3 different actions 18 times. Widened at 1 different actions 2 times. Performed 190 root evaluator evaluations with a maximum evaluation depth of 3. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-12 20:30:46,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:46,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:46,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:46,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:46,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-12 20:30:46,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:30:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:30:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:30:46,849 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-12 20:30:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:47,130 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-12 20:30:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:30:47,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-12 20:30:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:47,132 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:30:47,132 INFO L226 Difference]: Without dead ends: 32 [2018-11-12 20:30:47,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:30:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-12 20:30:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-11-12 20:30:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:30:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-12 20:30:47,139 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-11-12 20:30:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:47,139 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-12 20:30:47,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:30:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-12 20:30:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:30:47,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:47,141 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:47,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:47,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 377601812, now seen corresponding path program 2 times [2018-11-12 20:30:47,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:47,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:47,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:47,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:47,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:47,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:47,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-12 20:30:47,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:47,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:30:47,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:30:47,579 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:30:47,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-12 20:30:47,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:47,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:30:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:30:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:30:47,581 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-11-12 20:30:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:47,752 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-12 20:30:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:30:47,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-12 20:30:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:47,755 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:30:47,755 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:30:47,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:30:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:30:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-12 20:30:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-12 20:30:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-12 20:30:47,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-12 20:30:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:47,761 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-12 20:30:47,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:30:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-12 20:30:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:30:47,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:47,763 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:47,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:47,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1343240274, now seen corresponding path program 1 times [2018-11-12 20:30:47,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:47,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:30:47,889 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [38], [41], [43], [49], [50], [51], [53] [2018-11-12 20:30:47,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:47,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:48,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:48,120 INFO L272 AbstractInterpreter]: Visited 19 different actions 91 times. Merged at 7 different actions 42 times. Widened at 2 different actions 4 times. Performed 503 root evaluator evaluations with a maximum evaluation depth of 3. Performed 503 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-12 20:30:48,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:48,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:48,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:48,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:48,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:48,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:48,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:48,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:48,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-12 20:30:48,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:48,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:30:48,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:30:48,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:30:48,287 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-11-12 20:30:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:48,462 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-12 20:30:48,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:30:48,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-12 20:30:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:48,464 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:30:48,465 INFO L226 Difference]: Without dead ends: 38 [2018-11-12 20:30:48,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:30:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-12 20:30:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-11-12 20:30:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:30:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-12 20:30:48,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2018-11-12 20:30:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:48,471 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-12 20:30:48,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:30:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-12 20:30:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:30:48,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:48,473 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:48,473 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:48,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1859017687, now seen corresponding path program 2 times [2018-11-12 20:30:48,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:48,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:48,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:48,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:48,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:48,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:48,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:30:48,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:48,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:30:48,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:30:49,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-12 20:30:49,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:49,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:30:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:30:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:30:49,130 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-11-12 20:30:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:49,252 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-12 20:30:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:30:49,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-12 20:30:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:49,254 INFO L225 Difference]: With dead ends: 58 [2018-11-12 20:30:49,254 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:30:49,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:30:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-12 20:30:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-12 20:30:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-12 20:30:49,262 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2018-11-12 20:30:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:49,262 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-12 20:30:49,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:30:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-12 20:30:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:30:49,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:49,264 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:49,264 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:49,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 192508852, now seen corresponding path program 3 times [2018-11-12 20:30:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:49,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:49,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:49,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:49,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:49,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:49,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:49,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:49,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:49,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:49,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:49,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-12 20:30:49,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:49,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:30:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:30:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:49,660 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 8 states. [2018-11-12 20:30:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:49,852 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-12 20:30:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:30:49,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-12 20:30:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:49,854 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:30:49,854 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:30:49,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:30:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-12 20:30:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-12 20:30:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-12 20:30:49,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2018-11-12 20:30:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:49,861 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-12 20:30:49,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:30:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-12 20:30:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-12 20:30:49,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:49,863 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:49,863 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:49,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -82233969, now seen corresponding path program 4 times [2018-11-12 20:30:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:49,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:49,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:49,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:49,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:50,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:50,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:50,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-12 20:30:50,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:50,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:30:50,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:30:50,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:50,248 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 9 states. [2018-11-12 20:30:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:50,473 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-12 20:30:50,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:30:50,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-12 20:30:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:50,476 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:30:50,476 INFO L226 Difference]: Without dead ends: 56 [2018-11-12 20:30:50,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-12 20:30:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-11-12 20:30:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-12 20:30:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-12 20:30:50,483 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2018-11-12 20:30:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:50,484 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-12 20:30:50,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:30:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-12 20:30:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:30:50,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:50,485 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:50,485 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:50,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1262051796, now seen corresponding path program 5 times [2018-11-12 20:30:50,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:51,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:51,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:51,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:51,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:51,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:30:51,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:51,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:30:51,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:30:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-11-12 20:30:51,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:51,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:30:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:30:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:51,513 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 12 states. [2018-11-12 20:30:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:51,697 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-12 20:30:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:30:51,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-12 20:30:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:51,698 INFO L225 Difference]: With dead ends: 85 [2018-11-12 20:30:51,698 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:30:51,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:30:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:30:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-12 20:30:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:30:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-12 20:30:51,706 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 45 [2018-11-12 20:30:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:51,707 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-12 20:30:51,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:30:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-12 20:30:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-12 20:30:51,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:51,708 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:51,709 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:51,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash -65813737, now seen corresponding path program 6 times [2018-11-12 20:30:51,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:51,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:51,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:51,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:51,898 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:51,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:51,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:51,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:51,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:51,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:51,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:51,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:51,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:52,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:52,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-12 20:30:52,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:52,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:30:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:30:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:52,191 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 11 states. [2018-11-12 20:30:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:52,357 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-12 20:30:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:30:52,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-12 20:30:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:52,359 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:30:52,359 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:30:52,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:30:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-11-12 20:30:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-12 20:30:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-12 20:30:52,368 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2018-11-12 20:30:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:52,368 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-12 20:30:52,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:30:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-12 20:30:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-12 20:30:52,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:52,370 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:52,370 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:52,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1181148210, now seen corresponding path program 7 times [2018-11-12 20:30:52,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:52,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:52,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:52,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:52,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:52,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:52,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:52,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:52,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:52,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:52,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-12 20:30:52,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:52,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:30:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:30:52,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:30:52,958 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 12 states. [2018-11-12 20:30:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:53,094 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-12 20:30:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:30:53,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-11-12 20:30:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:53,096 INFO L225 Difference]: With dead ends: 103 [2018-11-12 20:30:53,096 INFO L226 Difference]: Without dead ends: 74 [2018-11-12 20:30:53,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:30:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-12 20:30:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-12 20:30:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-12 20:30:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-12 20:30:53,106 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2018-11-12 20:30:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:53,106 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-12 20:30:53,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:30:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-12 20:30:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-12 20:30:53,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:53,108 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:53,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:53,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2042599113, now seen corresponding path program 8 times [2018-11-12 20:30:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:53,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:53,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:30:53,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:53,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:53,398 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:53,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:53,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:53,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:53,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:53,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:30:53,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:53,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 20:30:53,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 20:30:53,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-11-12 20:30:53,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:53,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:30:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:30:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:30:53,890 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2018-11-12 20:30:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:54,105 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-12 20:30:54,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:30:54,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-11-12 20:30:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:54,107 INFO L225 Difference]: With dead ends: 112 [2018-11-12 20:30:54,108 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:30:54,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:30:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-12 20:30:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:30:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-12 20:30:54,117 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 63 [2018-11-12 20:30:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:54,117 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-12 20:30:54,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:30:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-12 20:30:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-12 20:30:54,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:54,119 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:54,119 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:54,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1037724716, now seen corresponding path program 9 times [2018-11-12 20:30:54,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:54,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:54,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:54,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:54,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:54,397 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:54,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:54,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:54,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:54,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:54,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:54,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:54,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-12 20:30:55,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:55,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:30:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:30:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:55,304 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 14 states. [2018-11-12 20:30:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:55,417 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-11-12 20:30:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:30:55,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2018-11-12 20:30:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:55,419 INFO L225 Difference]: With dead ends: 123 [2018-11-12 20:30:55,419 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:30:55,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:30:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-11-12 20:30:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:30:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-12 20:30:55,429 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2018-11-12 20:30:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:55,430 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-12 20:30:55,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:30:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-12 20:30:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-12 20:30:55,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:55,431 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:55,432 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:55,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -448084945, now seen corresponding path program 10 times [2018-11-12 20:30:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:55,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:55,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:55,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:55,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:55,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:55,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:55,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:55,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:55,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:55,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:55,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:55,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:56,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:56,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-12 20:30:56,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:56,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:30:56,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:30:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:30:56,167 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 15 states. [2018-11-12 20:30:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:56,446 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-12 20:30:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:30:56,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-11-12 20:30:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:56,448 INFO L225 Difference]: With dead ends: 130 [2018-11-12 20:30:56,448 INFO L226 Difference]: Without dead ends: 92 [2018-11-12 20:30:56,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:30:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-12 20:30:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-11-12 20:30:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-12 20:30:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-12 20:30:56,455 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2018-11-12 20:30:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:56,455 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-12 20:30:56,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:30:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-12 20:30:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-12 20:30:56,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:56,457 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:56,458 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:56,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -905907724, now seen corresponding path program 11 times [2018-11-12 20:30:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:56,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-12 20:30:57,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:57,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:57,288 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:57,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:57,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:57,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:57,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:57,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:57,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:30:57,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:57,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-12 20:30:57,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-12 20:30:57,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2018-11-12 20:30:57,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:57,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:30:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:30:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:30:57,884 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 18 states. [2018-11-12 20:30:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:58,069 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-11-12 20:30:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:30:58,070 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-11-12 20:30:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:58,071 INFO L225 Difference]: With dead ends: 139 [2018-11-12 20:30:58,072 INFO L226 Difference]: Without dead ends: 96 [2018-11-12 20:30:58,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:30:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-12 20:30:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-12 20:30:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-12 20:30:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-12 20:30:58,079 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 81 [2018-11-12 20:30:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:58,079 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-12 20:30:58,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:30:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-12 20:30:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-12 20:30:58,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:58,080 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:58,081 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:58,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 773593207, now seen corresponding path program 12 times [2018-11-12 20:30:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:58,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:58,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:58,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:58,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:58,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:58,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:58,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:58,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:58,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:58,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:58,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:58,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:58,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-12 20:30:59,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:30:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:30:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:30:59,004 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 17 states. [2018-11-12 20:30:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:59,172 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-11-12 20:30:59,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:30:59,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-12 20:30:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:59,174 INFO L225 Difference]: With dead ends: 150 [2018-11-12 20:30:59,174 INFO L226 Difference]: Without dead ends: 103 [2018-11-12 20:30:59,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:30:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-12 20:30:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-11-12 20:30:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-12 20:30:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-11-12 20:30:59,180 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2018-11-12 20:30:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:59,180 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-12 20:30:59,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:30:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-12 20:30:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-12 20:30:59,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:59,182 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:59,182 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:59,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1075443694, now seen corresponding path program 13 times [2018-11-12 20:30:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:59,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:59,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:59,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:59,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:59,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:59,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:59,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:59,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:59,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:59,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:30:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:59,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-12 20:30:59,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:59,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:30:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:30:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:30:59,986 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 18 states. [2018-11-12 20:31:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:00,340 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-11-12 20:31:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:31:00,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-11-12 20:31:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:00,342 INFO L225 Difference]: With dead ends: 157 [2018-11-12 20:31:00,342 INFO L226 Difference]: Without dead ends: 110 [2018-11-12 20:31:00,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:31:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-12 20:31:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-11-12 20:31:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-12 20:31:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-12 20:31:00,350 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 96 [2018-11-12 20:31:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:00,350 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-12 20:31:00,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:31:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-12 20:31:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:31:00,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:00,352 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:00,352 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:00,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:00,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1516777111, now seen corresponding path program 14 times [2018-11-12 20:31:00,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 20:31:00,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:00,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:00,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:00,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:00,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:00,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:00,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:00,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:00,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-12 20:31:00,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:00,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-12 20:31:01,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-12 20:31:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:02,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2018-11-12 20:31:02,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:02,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:31:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:31:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:31:02,175 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2018-11-12 20:31:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:02,366 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-11-12 20:31:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:31:02,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-11-12 20:31:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:02,368 INFO L225 Difference]: With dead ends: 166 [2018-11-12 20:31:02,368 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:31:02,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:31:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:31:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-12 20:31:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-12 20:31:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-11-12 20:31:02,374 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 99 [2018-11-12 20:31:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:02,375 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-11-12 20:31:02,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:31:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-11-12 20:31:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-12 20:31:02,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:02,376 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:02,376 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:02,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 280509428, now seen corresponding path program 15 times [2018-11-12 20:31:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:02,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:02,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:02,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:02,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:02,630 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:02,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:02,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:02,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:02,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:02,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:02,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:02,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:02,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:02,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:03,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-12 20:31:03,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:03,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:31:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:31:03,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:31:03,806 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2018-11-12 20:31:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:04,223 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-11-12 20:31:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:31:04,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-11-12 20:31:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:04,225 INFO L225 Difference]: With dead ends: 177 [2018-11-12 20:31:04,226 INFO L226 Difference]: Without dead ends: 121 [2018-11-12 20:31:04,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:31:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-12 20:31:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-11-12 20:31:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:31:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-11-12 20:31:04,230 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2018-11-12 20:31:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:04,231 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-11-12 20:31:04,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:31:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-11-12 20:31:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-12 20:31:04,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:04,232 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:04,232 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:04,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:04,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1179804977, now seen corresponding path program 16 times [2018-11-12 20:31:04,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:04,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:04,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:04,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:04,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:04,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:04,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:04,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:04,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:04,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:04,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:04,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-12 20:31:05,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:05,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:31:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:31:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:31:05,620 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 21 states. [2018-11-12 20:31:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:05,792 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-11-12 20:31:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:31:05,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-11-12 20:31:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:05,794 INFO L225 Difference]: With dead ends: 184 [2018-11-12 20:31:05,795 INFO L226 Difference]: Without dead ends: 128 [2018-11-12 20:31:05,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:31:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-12 20:31:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2018-11-12 20:31:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-12 20:31:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-12 20:31:05,800 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 114 [2018-11-12 20:31:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:05,800 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-12 20:31:05,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:31:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-12 20:31:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 20:31:05,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:05,801 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:05,801 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1682503148, now seen corresponding path program 17 times [2018-11-12 20:31:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:05,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:05,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-12 20:31:07,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:07,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:07,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:07,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:07,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:07,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:07,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:07,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-12 20:31:07,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:07,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-12 20:31:07,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-12 20:31:07,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:07,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2018-11-12 20:31:07,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:07,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:31:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:31:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:31:07,762 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 24 states. [2018-11-12 20:31:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:08,003 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-11-12 20:31:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:31:08,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2018-11-12 20:31:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:08,005 INFO L225 Difference]: With dead ends: 193 [2018-11-12 20:31:08,006 INFO L226 Difference]: Without dead ends: 132 [2018-11-12 20:31:08,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:31:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-12 20:31:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-12 20:31:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-12 20:31:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-11-12 20:31:08,012 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 117 [2018-11-12 20:31:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:08,013 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-11-12 20:31:08,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:31:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-11-12 20:31:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:31:08,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:08,014 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:08,014 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:08,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1944856023, now seen corresponding path program 18 times [2018-11-12 20:31:08,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:08,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:08,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:08,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:08,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:08,601 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:08,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:08,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:08,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:08,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:08,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:08,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:08,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:08,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:08,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:09,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:09,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-12 20:31:09,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:09,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:31:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:31:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:31:09,250 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 23 states. [2018-11-12 20:31:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:09,461 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-11-12 20:31:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:31:09,462 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-11-12 20:31:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:09,464 INFO L225 Difference]: With dead ends: 204 [2018-11-12 20:31:09,464 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:31:09,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:31:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:31:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-11-12 20:31:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-12 20:31:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-11-12 20:31:09,471 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2018-11-12 20:31:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:09,472 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-11-12 20:31:09,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:31:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-11-12 20:31:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-12 20:31:09,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:09,473 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:09,473 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:09,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:09,473 INFO L82 PathProgramCache]: Analyzing trace with hash 709338098, now seen corresponding path program 19 times [2018-11-12 20:31:09,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:09,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:09,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:09,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:09,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:09,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:09,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:09,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:09,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:09,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:09,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:09,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:09,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:10,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-12 20:31:10,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:10,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:31:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:31:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:31:10,573 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 24 states. [2018-11-12 20:31:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:10,773 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-11-12 20:31:10,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:31:10,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 132 [2018-11-12 20:31:10,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:10,775 INFO L225 Difference]: With dead ends: 211 [2018-11-12 20:31:10,775 INFO L226 Difference]: Without dead ends: 146 [2018-11-12 20:31:10,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:31:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-12 20:31:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2018-11-12 20:31:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-12 20:31:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-11-12 20:31:10,781 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2018-11-12 20:31:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:10,782 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-11-12 20:31:10,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:31:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-11-12 20:31:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-12 20:31:10,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:10,783 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:10,783 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:10,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1264561143, now seen corresponding path program 20 times [2018-11-12 20:31:10,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:10,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:10,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-12 20:31:11,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:11,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:11,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:11,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:11,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:11,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:11,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:11,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:11,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-12 20:31:11,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:11,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-12 20:31:12,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-12 20:31:12,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-12 20:31:12,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:12,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:31:12,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:31:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:12,912 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 27 states. [2018-11-12 20:31:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:13,205 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2018-11-12 20:31:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:31:13,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 135 [2018-11-12 20:31:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:13,207 INFO L225 Difference]: With dead ends: 220 [2018-11-12 20:31:13,207 INFO L226 Difference]: Without dead ends: 150 [2018-11-12 20:31:13,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:31:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-12 20:31:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-12 20:31:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-12 20:31:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-11-12 20:31:13,214 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 135 [2018-11-12 20:31:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:13,214 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-11-12 20:31:13,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:31:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-11-12 20:31:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 20:31:13,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:13,215 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:13,215 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:13,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1991732244, now seen corresponding path program 21 times [2018-11-12 20:31:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:13,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:13,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:13,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:13,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:13,534 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:13,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:13,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:13,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:13,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:13,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:13,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:13,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:13,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:14,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:14,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-12 20:31:14,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:14,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:31:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:31:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:14,410 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 26 states. [2018-11-12 20:31:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:14,681 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-11-12 20:31:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:31:14,685 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2018-11-12 20:31:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:14,687 INFO L225 Difference]: With dead ends: 231 [2018-11-12 20:31:14,687 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:31:14,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:31:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2018-11-12 20:31:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-12 20:31:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-11-12 20:31:14,693 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 147 [2018-11-12 20:31:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:14,693 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-11-12 20:31:14,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:31:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-11-12 20:31:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-12 20:31:14,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:14,694 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:14,694 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:14,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -110642833, now seen corresponding path program 22 times [2018-11-12 20:31:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:14,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:14,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:14,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:15,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:15,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:15,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:15,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:15,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:15,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:15,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:15,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:15,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:15,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-12 20:31:15,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:15,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:31:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:31:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:31:15,909 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 27 states. [2018-11-12 20:31:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:16,159 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2018-11-12 20:31:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:31:16,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-11-12 20:31:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:16,163 INFO L225 Difference]: With dead ends: 238 [2018-11-12 20:31:16,163 INFO L226 Difference]: Without dead ends: 164 [2018-11-12 20:31:16,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:31:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-12 20:31:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-11-12 20:31:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:31:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-11-12 20:31:16,170 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2018-11-12 20:31:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-11-12 20:31:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:31:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-11-12 20:31:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-12 20:31:16,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:16,171 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:16,172 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:16,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1541515828, now seen corresponding path program 23 times [2018-11-12 20:31:16,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:16,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:16,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:16,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:16,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-12 20:31:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:16,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:16,761 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:16,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:16,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:16,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:17,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-12 20:31:17,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:17,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-12 20:31:18,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-12 20:31:19,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 55 [2018-11-12 20:31:19,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:19,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:31:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:31:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:31:19,973 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 30 states. [2018-11-12 20:31:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:21,040 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2018-11-12 20:31:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:31:21,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 153 [2018-11-12 20:31:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:21,043 INFO L225 Difference]: With dead ends: 247 [2018-11-12 20:31:21,043 INFO L226 Difference]: Without dead ends: 168 [2018-11-12 20:31:21,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:31:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-12 20:31:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-11-12 20:31:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-12 20:31:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-11-12 20:31:21,050 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 153 [2018-11-12 20:31:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:21,050 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-11-12 20:31:21,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:31:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-11-12 20:31:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-12 20:31:21,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:21,052 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:21,052 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:21,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1394469687, now seen corresponding path program 24 times [2018-11-12 20:31:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:22,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:22,941 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:22,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:22,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:22,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:22,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:23,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:23,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:23,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:23,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:24,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:24,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-12 20:31:24,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:24,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:31:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:31:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:31:24,500 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 29 states. [2018-11-12 20:31:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:24,745 INFO L93 Difference]: Finished difference Result 258 states and 261 transitions. [2018-11-12 20:31:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:31:24,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 165 [2018-11-12 20:31:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:24,747 INFO L225 Difference]: With dead ends: 258 [2018-11-12 20:31:24,747 INFO L226 Difference]: Without dead ends: 175 [2018-11-12 20:31:24,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:31:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-12 20:31:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2018-11-12 20:31:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-12 20:31:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-11-12 20:31:24,753 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 165 [2018-11-12 20:31:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:24,753 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-11-12 20:31:24,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:31:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-11-12 20:31:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-12 20:31:24,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:24,754 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:24,755 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:24,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -456804398, now seen corresponding path program 25 times [2018-11-12 20:31:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:24,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:24,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1977 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:25,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:25,268 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:25,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:25,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:25,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:25,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:25,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:25,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1977 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:25,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1977 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-12 20:31:26,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:26,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:31:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:31:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:31:26,384 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 30 states. [2018-11-12 20:31:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:27,266 INFO L93 Difference]: Finished difference Result 265 states and 269 transitions. [2018-11-12 20:31:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:31:27,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 168 [2018-11-12 20:31:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:27,268 INFO L225 Difference]: With dead ends: 265 [2018-11-12 20:31:27,268 INFO L226 Difference]: Without dead ends: 182 [2018-11-12 20:31:27,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:31:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-12 20:31:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2018-11-12 20:31:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-12 20:31:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-12 20:31:27,275 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 168 [2018-11-12 20:31:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:27,275 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-12 20:31:27,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:31:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-12 20:31:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-12 20:31:27,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:27,276 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:27,277 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:27,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash -88022697, now seen corresponding path program 26 times [2018-11-12 20:31:27,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:27,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:27,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-12 20:31:28,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:28,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:28,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:28,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:28,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:28,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:28,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:29,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-12 20:31:29,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:29,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-11-12 20:31:29,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-11-12 20:31:30,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:30,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 61 [2018-11-12 20:31:30,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:30,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:31:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:31:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:31:30,710 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 33 states. [2018-11-12 20:31:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:31,010 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2018-11-12 20:31:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:31:31,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 171 [2018-11-12 20:31:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:31,012 INFO L225 Difference]: With dead ends: 274 [2018-11-12 20:31:31,013 INFO L226 Difference]: Without dead ends: 186 [2018-11-12 20:31:31,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:31:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-12 20:31:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-12 20:31:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-12 20:31:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-11-12 20:31:31,020 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 171 [2018-11-12 20:31:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:31,020 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-11-12 20:31:31,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:31:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-11-12 20:31:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-12 20:31:31,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:31,021 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:31,022 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:31,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash 841557044, now seen corresponding path program 27 times [2018-11-12 20:31:31,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:31,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:31,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:33,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:33,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:33,041 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:33,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:33,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:33,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:33,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:33,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:33,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:33,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:33,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:33,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-12 20:31:34,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:34,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:31:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:31:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:31:34,124 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 32 states. [2018-11-12 20:31:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:34,633 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-11-12 20:31:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:31:34,633 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-11-12 20:31:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:34,635 INFO L225 Difference]: With dead ends: 285 [2018-11-12 20:31:34,635 INFO L226 Difference]: Without dead ends: 193 [2018-11-12 20:31:34,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:31:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-12 20:31:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-11-12 20:31:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-12 20:31:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-11-12 20:31:34,642 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 183 [2018-11-12 20:31:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:34,642 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-11-12 20:31:34,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:31:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-11-12 20:31:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 20:31:34,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:34,644 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:34,644 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:34,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1809899505, now seen corresponding path program 28 times [2018-11-12 20:31:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:34,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:34,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:36,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:36,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:36,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:36,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:36,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:36,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:36,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:36,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:36,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:37,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:37,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-12 20:31:37,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:31:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:31:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:31:37,468 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 33 states. [2018-11-12 20:31:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:37,857 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2018-11-12 20:31:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:31:37,858 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 186 [2018-11-12 20:31:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:37,859 INFO L225 Difference]: With dead ends: 292 [2018-11-12 20:31:37,859 INFO L226 Difference]: Without dead ends: 200 [2018-11-12 20:31:37,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:31:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-12 20:31:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2018-11-12 20:31:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-12 20:31:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-11-12 20:31:37,865 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 186 [2018-11-12 20:31:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:37,866 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-11-12 20:31:37,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:31:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-11-12 20:31:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-12 20:31:37,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:37,867 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:37,869 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1686557268, now seen corresponding path program 29 times [2018-11-12 20:31:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:37,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:31:38,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:38,451 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:38,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:38,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:38,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:38,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:41,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-12 20:31:41,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:41,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2018-11-12 20:31:41,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2018-11-12 20:31:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:42,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-11-12 20:31:42,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:42,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:31:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:31:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:31:42,307 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 35 states. [2018-11-12 20:31:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:43,034 INFO L93 Difference]: Finished difference Result 301 states and 306 transitions. [2018-11-12 20:31:43,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:31:43,035 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-11-12 20:31:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:43,036 INFO L225 Difference]: With dead ends: 301 [2018-11-12 20:31:43,036 INFO L226 Difference]: Without dead ends: 204 [2018-11-12 20:31:43,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:31:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-12 20:31:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2018-11-12 20:31:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-12 20:31:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-11-12 20:31:43,042 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 189 [2018-11-12 20:31:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:43,043 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-11-12 20:31:43,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:31:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-11-12 20:31:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-12 20:31:43,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:43,044 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:43,045 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:43,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 852191383, now seen corresponding path program 30 times [2018-11-12 20:31:43,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:43,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:43,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:43,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:43,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:43,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:43,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:43,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:43,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:43,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:43,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:43,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:43,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:43,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:43,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:45,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:45,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-12 20:31:45,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:45,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:31:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:31:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:31:45,135 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 35 states. [2018-11-12 20:31:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:45,559 INFO L93 Difference]: Finished difference Result 312 states and 315 transitions. [2018-11-12 20:31:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:31:45,560 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 201 [2018-11-12 20:31:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:45,562 INFO L225 Difference]: With dead ends: 312 [2018-11-12 20:31:45,562 INFO L226 Difference]: Without dead ends: 211 [2018-11-12 20:31:45,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:31:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-12 20:31:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2018-11-12 20:31:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-12 20:31:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-11-12 20:31:45,567 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 201 [2018-11-12 20:31:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:45,567 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-11-12 20:31:45,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:31:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-11-12 20:31:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-12 20:31:45,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:45,568 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:45,569 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:45,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -535149646, now seen corresponding path program 31 times [2018-11-12 20:31:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:45,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:45,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:46,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:46,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:46,109 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:46,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:46,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:46,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:46,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:46,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:46,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:47,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-12 20:31:47,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:47,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:31:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:31:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:31:47,603 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 36 states. [2018-11-12 20:31:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:48,087 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2018-11-12 20:31:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:31:48,087 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 204 [2018-11-12 20:31:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:48,088 INFO L225 Difference]: With dead ends: 319 [2018-11-12 20:31:48,088 INFO L226 Difference]: Without dead ends: 218 [2018-11-12 20:31:48,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:31:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-12 20:31:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2018-11-12 20:31:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-12 20:31:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-11-12 20:31:48,095 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2018-11-12 20:31:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:48,095 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-11-12 20:31:48,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:31:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-11-12 20:31:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-12 20:31:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:48,097 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:48,097 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash -341455177, now seen corresponding path program 32 times [2018-11-12 20:31:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:48,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:48,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3107 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2018-11-12 20:31:48,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:48,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:48,697 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:48,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:48,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:48,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:48,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:56,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-12 20:31:56,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:56,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3107 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-11-12 20:31:57,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3107 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-11-12 20:31:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 73 [2018-11-12 20:31:58,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:58,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:31:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:31:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2356, Invalid=2900, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:31:58,818 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 39 states. [2018-11-12 20:32:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:00,267 INFO L93 Difference]: Finished difference Result 328 states and 333 transitions. [2018-11-12 20:32:00,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:32:00,268 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 207 [2018-11-12 20:32:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:00,270 INFO L225 Difference]: With dead ends: 328 [2018-11-12 20:32:00,270 INFO L226 Difference]: Without dead ends: 222 [2018-11-12 20:32:00,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2362, Invalid=3040, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:32:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-12 20:32:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-11-12 20:32:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-12 20:32:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-11-12 20:32:00,276 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 207 [2018-11-12 20:32:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:00,276 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-11-12 20:32:00,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:32:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-11-12 20:32:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-12 20:32:00,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:00,278 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:00,278 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:00,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1617730476, now seen corresponding path program 33 times [2018-11-12 20:32:00,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:00,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:00,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:02,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:02,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:02,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:02,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:02,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:02,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:02,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:02,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:02,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:02,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:02,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:04,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-12 20:32:04,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:04,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:32:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:32:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:32:04,057 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 38 states. [2018-11-12 20:32:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:04,438 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-11-12 20:32:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:32:04,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2018-11-12 20:32:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:04,440 INFO L225 Difference]: With dead ends: 339 [2018-11-12 20:32:04,440 INFO L226 Difference]: Without dead ends: 229 [2018-11-12 20:32:04,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:32:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-12 20:32:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-11-12 20:32:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-12 20:32:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-11-12 20:32:04,446 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 219 [2018-11-12 20:32:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:04,447 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-11-12 20:32:04,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:32:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-11-12 20:32:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-12 20:32:04,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:04,448 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:04,448 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:04,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1207553711, now seen corresponding path program 34 times [2018-11-12 20:32:04,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:04,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:04,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:04,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3606 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:05,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:05,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:05,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:05,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:05,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:05,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:05,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:05,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3606 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:05,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3606 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:07,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-12 20:32:07,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:07,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:32:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:32:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:32:07,271 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 39 states. [2018-11-12 20:32:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:07,622 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-11-12 20:32:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:32:07,623 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 222 [2018-11-12 20:32:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:07,625 INFO L225 Difference]: With dead ends: 346 [2018-11-12 20:32:07,625 INFO L226 Difference]: Without dead ends: 236 [2018-11-12 20:32:07,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:32:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-12 20:32:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2018-11-12 20:32:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-12 20:32:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-11-12 20:32:07,631 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2018-11-12 20:32:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:07,632 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-11-12 20:32:07,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:32:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-11-12 20:32:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-12 20:32:07,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:07,633 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:07,634 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:07,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 774668916, now seen corresponding path program 35 times [2018-11-12 20:32:07,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:07,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3713 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2018-11-12 20:32:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:09,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:09,401 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:09,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:09,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:09,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:19,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-12 20:32:19,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:19,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3713 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2018-11-12 20:32:19,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3713 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2018-11-12 20:32:21,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-12 20:32:21,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:32:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:32:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:32:21,291 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 42 states. [2018-11-12 20:32:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:21,670 INFO L93 Difference]: Finished difference Result 355 states and 360 transitions. [2018-11-12 20:32:21,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:32:21,670 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 225 [2018-11-12 20:32:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:21,672 INFO L225 Difference]: With dead ends: 355 [2018-11-12 20:32:21,672 INFO L226 Difference]: Without dead ends: 240 [2018-11-12 20:32:21,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-12 20:32:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-12 20:32:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2018-11-12 20:32:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-12 20:32:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-11-12 20:32:21,679 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 225 [2018-11-12 20:32:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:21,680 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-11-12 20:32:21,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:32:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-11-12 20:32:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-12 20:32:21,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:21,681 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:21,681 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:21,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -74539529, now seen corresponding path program 36 times [2018-11-12 20:32:21,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:21,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:21,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:21,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:22,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:22,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:22,678 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:22,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:22,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:22,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:22,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:22,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:22,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:22,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:22,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:22,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:25,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:25,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-12 20:32:25,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:25,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:32:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:32:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:32:25,026 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 41 states. [2018-11-12 20:32:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:25,508 INFO L93 Difference]: Finished difference Result 366 states and 369 transitions. [2018-11-12 20:32:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:32:25,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-11-12 20:32:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:25,510 INFO L225 Difference]: With dead ends: 366 [2018-11-12 20:32:25,510 INFO L226 Difference]: Without dead ends: 247 [2018-11-12 20:32:25,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:32:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-12 20:32:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2018-11-12 20:32:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-12 20:32:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-11-12 20:32:25,516 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 237 [2018-11-12 20:32:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:25,516 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-11-12 20:32:25,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:32:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-11-12 20:32:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-12 20:32:25,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:25,517 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:25,518 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:25,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1048528786, now seen corresponding path program 37 times [2018-11-12 20:32:25,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:25,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:25,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4257 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:26,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:26,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:26,256 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:26,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:26,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:26,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:26,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:26,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4257 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:26,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4257 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-12 20:32:28,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:32:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:32:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:32:28,136 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 42 states. [2018-11-12 20:32:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:28,526 INFO L93 Difference]: Finished difference Result 373 states and 377 transitions. [2018-11-12 20:32:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:32:28,527 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 240 [2018-11-12 20:32:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:28,529 INFO L225 Difference]: With dead ends: 373 [2018-11-12 20:32:28,529 INFO L226 Difference]: Without dead ends: 254 [2018-11-12 20:32:28,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:32:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-12 20:32:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 244. [2018-11-12 20:32:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-12 20:32:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-11-12 20:32:28,536 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 240 [2018-11-12 20:32:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:28,537 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-11-12 20:32:28,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:32:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-11-12 20:32:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-12 20:32:28,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:28,538 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:28,539 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:28,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash 581465111, now seen corresponding path program 38 times [2018-11-12 20:32:28,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:28,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:28,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4373 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-12 20:32:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:29,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:29,551 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:29,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:29,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:29,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:29,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:43,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-12 20:32:43,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:43,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4373 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2301 trivial. 0 not checked. [2018-11-12 20:32:43,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4373 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2301 trivial. 0 not checked. [2018-11-12 20:32:45,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-12 20:32:45,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:45,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:32:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:32:45,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:32:45,875 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 45 states. [2018-11-12 20:32:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:46,302 INFO L93 Difference]: Finished difference Result 382 states and 387 transitions. [2018-11-12 20:32:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:32:46,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 243 [2018-11-12 20:32:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:46,304 INFO L225 Difference]: With dead ends: 382 [2018-11-12 20:32:46,304 INFO L226 Difference]: Without dead ends: 258 [2018-11-12 20:32:46,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-12 20:32:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-12 20:32:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-12 20:32:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-12 20:32:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-11-12 20:32:46,311 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 243 [2018-11-12 20:32:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:46,311 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-11-12 20:32:46,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:32:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-11-12 20:32:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-12 20:32:46,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:46,313 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:46,313 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:46,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1711526796, now seen corresponding path program 39 times [2018-11-12 20:32:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:47,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:47,096 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:47,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:47,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:47,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:47,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:47,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:47,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:47,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:49,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-12 20:32:49,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:49,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:32:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:32:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:32:49,067 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 44 states. [2018-11-12 20:32:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:49,578 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-11-12 20:32:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:32:49,579 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2018-11-12 20:32:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:49,580 INFO L225 Difference]: With dead ends: 393 [2018-11-12 20:32:49,580 INFO L226 Difference]: Without dead ends: 265 [2018-11-12 20:32:49,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:32:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-12 20:32:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2018-11-12 20:32:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-12 20:32:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-11-12 20:32:49,587 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 255 [2018-11-12 20:32:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:49,588 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-11-12 20:32:49,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:32:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-11-12 20:32:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-12 20:32:49,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:49,590 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:49,590 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:49,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash 27116879, now seen corresponding path program 40 times [2018-11-12 20:32:49,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:49,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:49,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4962 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:50,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:50,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:50,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:50,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:50,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:50,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:50,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:50,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:50,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4962 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:50,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4962 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:52,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-12 20:32:52,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:52,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:32:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:32:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:32:52,891 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 45 states. [2018-11-12 20:32:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:53,349 INFO L93 Difference]: Finished difference Result 400 states and 404 transitions. [2018-11-12 20:32:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:32:53,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 258 [2018-11-12 20:32:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:53,352 INFO L225 Difference]: With dead ends: 400 [2018-11-12 20:32:53,352 INFO L226 Difference]: Without dead ends: 272 [2018-11-12 20:32:53,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:32:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-12 20:32:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2018-11-12 20:32:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-12 20:32:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 263 transitions. [2018-11-12 20:32:53,358 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 263 transitions. Word has length 258 [2018-11-12 20:32:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:53,358 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 263 transitions. [2018-11-12 20:32:53,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:32:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 263 transitions. [2018-11-12 20:32:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-12 20:32:53,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:53,360 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:53,361 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:53,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:53,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1344750956, now seen corresponding path program 41 times [2018-11-12 20:32:53,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:53,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:53,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5087 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-11-12 20:32:54,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:54,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:54,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:54,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:54,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:54,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:54,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:18,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-12 20:33:18,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:18,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5087 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2018-11-12 20:33:18,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5087 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2018-11-12 20:33:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:21,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-12 20:33:21,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:21,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:33:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:33:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:33:21,411 INFO L87 Difference]: Start difference. First operand 262 states and 263 transitions. Second operand 48 states. [2018-11-12 20:33:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:21,917 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2018-11-12 20:33:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:33:21,918 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 261 [2018-11-12 20:33:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:21,919 INFO L225 Difference]: With dead ends: 409 [2018-11-12 20:33:21,919 INFO L226 Difference]: Without dead ends: 276 [2018-11-12 20:33:21,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-12 20:33:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-12 20:33:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2018-11-12 20:33:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-12 20:33:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-11-12 20:33:21,927 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 261 [2018-11-12 20:33:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:21,927 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-11-12 20:33:21,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:33:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-11-12 20:33:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-12 20:33:21,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:21,929 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:21,929 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:21,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1216246953, now seen corresponding path program 42 times [2018-11-12 20:33:21,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:21,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:21,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:22,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:22,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:22,852 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:22,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:22,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:22,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:22,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:22,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:22,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:22,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:22,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:23,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:25,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-12 20:33:25,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:25,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:33:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:33:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:33:25,502 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 47 states. [2018-11-12 20:33:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:26,119 INFO L93 Difference]: Finished difference Result 420 states and 423 transitions. [2018-11-12 20:33:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:33:26,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 273 [2018-11-12 20:33:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:26,120 INFO L225 Difference]: With dead ends: 420 [2018-11-12 20:33:26,120 INFO L226 Difference]: Without dead ends: 283 [2018-11-12 20:33:26,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:33:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-12 20:33:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2018-11-12 20:33:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-12 20:33:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-11-12 20:33:26,128 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 273 [2018-11-12 20:33:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:26,128 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-11-12 20:33:26,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:33:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-11-12 20:33:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-12 20:33:26,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:26,130 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:26,130 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:26,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -206650510, now seen corresponding path program 43 times [2018-11-12 20:33:26,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:26,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:26,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:26,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:26,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5721 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:27,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:27,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:27,235 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:27,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:27,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:27,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:27,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:27,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5721 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:27,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5721 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:29,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:29,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-12 20:33:29,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:29,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:33:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:33:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-12 20:33:29,587 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 48 states. [2018-11-12 20:33:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:30,145 INFO L93 Difference]: Finished difference Result 427 states and 431 transitions. [2018-11-12 20:33:30,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:33:30,146 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 276 [2018-11-12 20:33:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:30,147 INFO L225 Difference]: With dead ends: 427 [2018-11-12 20:33:30,147 INFO L226 Difference]: Without dead ends: 290 [2018-11-12 20:33:30,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-12 20:33:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-12 20:33:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2018-11-12 20:33:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-12 20:33:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-11-12 20:33:30,154 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2018-11-12 20:33:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:30,154 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-11-12 20:33:30,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:33:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-11-12 20:33:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-12 20:33:30,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:30,156 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:30,156 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:30,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash -974990985, now seen corresponding path program 44 times [2018-11-12 20:33:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5855 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2018-11-12 20:33:31,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:31,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:31,281 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:31,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:31,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:31,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:31,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:31,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:56,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-12 20:33:56,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:56,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5855 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2018-11-12 20:33:56,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5855 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2018-11-12 20:33:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 97 [2018-11-12 20:33:58,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:33:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:33:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4288, Invalid=5024, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:33:58,667 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 51 states. [2018-11-12 20:33:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:59,203 INFO L93 Difference]: Finished difference Result 436 states and 441 transitions. [2018-11-12 20:33:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-12 20:33:59,203 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 279 [2018-11-12 20:33:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:59,205 INFO L225 Difference]: With dead ends: 436 [2018-11-12 20:33:59,205 INFO L226 Difference]: Without dead ends: 294 [2018-11-12 20:33:59,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4294, Invalid=5212, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:33:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-12 20:33:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-11-12 20:33:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-12 20:33:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2018-11-12 20:33:59,212 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 279 [2018-11-12 20:33:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:59,212 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 293 transitions. [2018-11-12 20:33:59,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:33:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 293 transitions. [2018-11-12 20:33:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-12 20:33:59,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:59,214 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:59,214 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:59,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash -622232428, now seen corresponding path program 45 times [2018-11-12 20:33:59,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:59,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:59,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:59,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:00,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:00,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:00,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:00,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:00,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:00,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:00,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:00,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:00,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:00,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:00,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-12 20:34:03,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:03,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:34:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:34:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:34:03,342 INFO L87 Difference]: Start difference. First operand 292 states and 293 transitions. Second operand 50 states. [2018-11-12 20:34:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:03,989 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-11-12 20:34:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:34:03,989 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2018-11-12 20:34:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:03,990 INFO L225 Difference]: With dead ends: 447 [2018-11-12 20:34:03,990 INFO L226 Difference]: Without dead ends: 301 [2018-11-12 20:34:03,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:34:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-12 20:34:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2018-11-12 20:34:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-12 20:34:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-11-12 20:34:03,998 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 291 [2018-11-12 20:34:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:03,998 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-11-12 20:34:03,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:34:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-11-12 20:34:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-12 20:34:04,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:04,000 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:04,000 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:04,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1009845231, now seen corresponding path program 46 times [2018-11-12 20:34:04,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:04,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:04,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:04,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:04,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:05,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:05,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:05,593 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:05,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:05,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:05,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:05,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:05,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:05,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:05,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:08,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:08,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-11-12 20:34:08,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:08,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:34:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:34:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-12 20:34:08,750 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 51 states. [2018-11-12 20:34:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:09,466 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-11-12 20:34:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-12 20:34:09,469 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 294 [2018-11-12 20:34:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:09,470 INFO L225 Difference]: With dead ends: 454 [2018-11-12 20:34:09,470 INFO L226 Difference]: Without dead ends: 308 [2018-11-12 20:34:09,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-12 20:34:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-12 20:34:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2018-11-12 20:34:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-12 20:34:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-11-12 20:34:09,496 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 294 [2018-11-12 20:34:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:09,497 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-11-12 20:34:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:34:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-11-12 20:34:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-12 20:34:09,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:09,499 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:09,499 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:09,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1089373516, now seen corresponding path program 47 times [2018-11-12 20:34:09,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:09,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:09,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:09,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6677 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2018-11-12 20:34:11,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:11,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:11,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:11,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:11,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:11,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:11,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:34,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-12 20:34:34,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:34,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6677 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2018-11-12 20:34:34,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6677 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2018-11-12 20:34:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 103 [2018-11-12 20:34:37,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:37,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:34:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:34:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4861, Invalid=5645, Unknown=0, NotChecked=0, Total=10506 [2018-11-12 20:34:37,282 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 54 states. [2018-11-12 20:34:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:37,869 INFO L93 Difference]: Finished difference Result 463 states and 468 transitions. [2018-11-12 20:34:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:34:37,869 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 297 [2018-11-12 20:34:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:37,872 INFO L225 Difference]: With dead ends: 463 [2018-11-12 20:34:37,872 INFO L226 Difference]: Without dead ends: 312 [2018-11-12 20:34:37,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4867, Invalid=5845, Unknown=0, NotChecked=0, Total=10712 [2018-11-12 20:34:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-12 20:34:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-11-12 20:34:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-12 20:34:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-11-12 20:34:37,878 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 297 [2018-11-12 20:34:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:37,878 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-11-12 20:34:37,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:34:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-11-12 20:34:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-12 20:34:37,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:37,880 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:37,880 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:37,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash 842936503, now seen corresponding path program 48 times [2018-11-12 20:34:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:37,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:37,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:37,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:37,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:39,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:39,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:39,030 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:39,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:39,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:39,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:39,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:39,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:39,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:39,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:39,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:39,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:41,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-11-12 20:34:41,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:41,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:34:41,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:34:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-11-12 20:34:41,855 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 53 states. [2018-11-12 20:34:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:42,593 INFO L93 Difference]: Finished difference Result 474 states and 477 transitions. [2018-11-12 20:34:42,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:34:42,593 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 309 [2018-11-12 20:34:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:42,595 INFO L225 Difference]: With dead ends: 474 [2018-11-12 20:34:42,595 INFO L226 Difference]: Without dead ends: 319 [2018-11-12 20:34:42,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-11-12 20:34:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-12 20:34:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 313. [2018-11-12 20:34:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-12 20:34:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-11-12 20:34:42,600 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 309 [2018-11-12 20:34:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:42,601 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-11-12 20:34:42,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:34:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-11-12 20:34:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-12 20:34:42,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:42,603 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:42,603 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:42,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1692579666, now seen corresponding path program 49 times [2018-11-12 20:34:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:42,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:42,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:42,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:42,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7401 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:43,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:43,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:43,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:43,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:43,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:43,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:43,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:43,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:43,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7401 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:43,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7401 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-11-12 20:34:46,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:46,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-11-12 20:34:46,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:46,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:34:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:34:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-11-12 20:34:46,826 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 54 states. Received shutdown request... [2018-11-12 20:34:47,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:34:47,129 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:34:47,134 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:34:47,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:34:47 BoogieIcfgContainer [2018-11-12 20:34:47,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:34:47,135 INFO L168 Benchmark]: Toolchain (without parser) took 242600.60 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 999.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -847.0 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:47,137 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:47,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:47,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:47,138 INFO L168 Benchmark]: Boogie Preprocessor took 36.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:47,138 INFO L168 Benchmark]: RCFGBuilder took 544.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:47,139 INFO L168 Benchmark]: TraceAbstraction took 241676.61 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 283.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -96.5 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:47,142 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 544.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241676.61 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 283.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -96.5 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (313states) and FLOYD_HOARE automaton (currently 53 states, 54 states before enhancement),while ReachableStatesComputation was computing reachable states (230 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. TIMEOUT Result, 241.6s OverallTime, 53 OverallIterations, 51 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 681 SDtfs, 4745 SDslu, 10102 SDs, 0 SdLazy, 9523 SolverSat, 1778 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17943 GetRequests, 15187 SyntacticMatches, 0 SemanticMatches, 2756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7829 ImplicationChecksByTransitivity, 98.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 303 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 112.4s SatisfiabilityAnalysisTime, 103.4s InterpolantComputationTime, 16570 NumberOfCodeBlocks, 16468 NumberOfCodeBlocksAsserted, 496 NumberOfCheckSat, 24686 ConstructedInterpolants, 0 QuantifiedInterpolants, 10125752 SizeOfPredicates, 91 NumberOfNonLiveVariables, 18703 ConjunctsInSsa, 1479 ConjunctsInUnsatCore, 155 InterpolantComputations, 4 PerfectInterpolantSequences, 188788/379134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown