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-df4b876 [2018-11-07 22:02:57,799 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:02:57,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:02:57,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:02:57,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:02:57,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:02:57,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:02:57,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:02:57,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:02:57,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:02:57,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:02:57,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:02:57,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:02:57,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:02:57,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:02:57,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:02:57,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:02:57,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:02:57,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:02:57,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:02:57,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:02:57,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:02:57,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:02:57,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:02:57,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:02:57,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:02:57,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:02:57,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:02:57,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:02:57,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:02:57,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:02:57,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:02:57,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:02:57,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:02:57,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:02:57,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:02:57,870 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:02:57,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:02:57,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:02:57,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:02:57,899 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:02:57,899 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:02:57,900 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:02:57,900 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:02:57,900 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:02:57,900 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:02:57,901 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:02:57,901 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:02:57,901 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:02:57,902 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:02:57,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:02:57,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:02:57,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:02:57,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:02:57,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:02:57,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:02:57,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:02:57,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:02:57,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:02:57,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:02:57,907 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:02:57,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:02:57,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:02:57,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:02:57,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:02:57,908 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:02:57,908 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:02:57,908 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:02:57,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:02:57,908 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:02:57,909 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:02:57,909 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:02:57,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:02:57,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:02:57,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:02:58,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:02:58,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:02:58,003 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-07 22:02:58,077 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696fe0f73/27e03f44138e484ea432d390835354cc/FLAG53aa1d796 [2018-11-07 22:02:58,524 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:02:58,524 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-07 22:02:58,531 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696fe0f73/27e03f44138e484ea432d390835354cc/FLAG53aa1d796 [2018-11-07 22:02:58,551 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696fe0f73/27e03f44138e484ea432d390835354cc [2018-11-07 22:02:58,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:02:58,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:02:58,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:58,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:02:58,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:02:58,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58, skipping insertion in model container [2018-11-07 22:02:58,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:02:58,607 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:02:58,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,806 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:02:58,831 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,856 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:02:58,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58 WrapperNode [2018-11-07 22:02:58,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:58,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:02:58,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:02:58,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:02:58,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:02:58,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:02:58,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:02:58,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:02:58,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:02:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:02:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:02:59,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:02:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:02:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:02:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:02:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:02:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:02:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:02:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:02:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:02:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:02:59,427 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:02:59,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:59 BoogieIcfgContainer [2018-11-07 22:02:59,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:02:59,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:02:59,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:02:59,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:02:59,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:58" (1/3) ... [2018-11-07 22:02:59,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267af35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:59, skipping insertion in model container [2018-11-07 22:02:59,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (2/3) ... [2018-11-07 22:02:59,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267af35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:59, skipping insertion in model container [2018-11-07 22:02:59,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:59" (3/3) ... [2018-11-07 22:02:59,436 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i [2018-11-07 22:02:59,446 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:02:59,454 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:02:59,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:02:59,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:02:59,505 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:02:59,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:02:59,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:02:59,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:02:59,505 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:02:59,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:02:59,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:02:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 22:02:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:02:59,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1215083166, now seen corresponding path program 1 times [2018-11-07 22:02:59,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:02:59,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:02:59,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:02:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:02:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:02:59,704 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 22:02:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,729 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-07 22:02:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:02:59,731 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 22:02:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,740 INFO L225 Difference]: With dead ends: 48 [2018-11-07 22:02:59,740 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:02:59,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:02:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:02:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:02:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:02:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 22:02:59,789 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-07 22:02:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,790 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 22:02:59,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:02:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 22:02:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:02:59,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1495716299, now seen corresponding path program 1 times [2018-11-07 22:02:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:02:59,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:02:59,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:02:59,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:02:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:02:59,902 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-07 22:03:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:00,127 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-07 22:03:00,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:03:00,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 22:03:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:00,131 INFO L225 Difference]: With dead ends: 42 [2018-11-07 22:03:00,131 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 22:03:00,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:03:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 22:03:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-07 22:03:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 22:03:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 22:03:00,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-07 22:03:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:00,141 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 22:03:00,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:03:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 22:03:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 22:03:00,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:00,143 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:00,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:00,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 37966098, now seen corresponding path program 1 times [2018-11-07 22:03:00,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:00,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 22:03:00,251 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 22:03:00,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:03:00,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:03:00,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:03:00,529 INFO L272 AbstractInterpreter]: Visited 21 different actions 57 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-07 22:03:00,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:00,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:03:00,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:00,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:00,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:00,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 22:03:00,844 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:00,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:03:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:03:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:03:00,846 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-07 22:03:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,141 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-07 22:03:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:03:01,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 22:03:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,144 INFO L225 Difference]: With dead ends: 52 [2018-11-07 22:03:01,145 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 22:03:01,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:03:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 22:03:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2018-11-07 22:03:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 22:03:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-07 22:03:01,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2018-11-07 22:03:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,152 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-07 22:03:01,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:03:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-07 22:03:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 22:03:01,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,154 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,154 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1224904619, now seen corresponding path program 2 times [2018-11-07 22:03:01,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:01,258 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:01,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:01,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:01,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:01,275 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:01,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 22:03:01,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:01,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 22:03:01,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 22:03:01,536 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:03:01,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 22:03:01,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:03:01,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:03:01,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:03:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:03:01,538 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-11-07 22:03:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,716 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-07 22:03:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:03:01,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 22:03:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,718 INFO L225 Difference]: With dead ends: 38 [2018-11-07 22:03:01,718 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:03:01,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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-07 22:03:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:03:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 22:03:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 22:03:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 22:03:01,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-11-07 22:03:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,725 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 22:03:01,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:03:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 22:03:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 22:03:01,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,727 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2066638414, now seen corresponding path program 1 times [2018-11-07 22:03:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:03:01,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:01,802 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 22:03:01,803 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [33], [35], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 22:03:01,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:03:01,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:03:01,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:03:01,984 INFO L272 AbstractInterpreter]: Visited 23 different actions 113 times. Merged at 10 different actions 60 times. Widened at 2 different actions 4 times. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 22:03:02,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:02,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:03:02,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:02,018 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:03:02,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:03:02,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 22:03:02,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:03:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:03:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:03:02,236 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2018-11-07 22:03:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:02,580 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-07 22:03:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:03:02,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-07 22:03:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:02,582 INFO L225 Difference]: With dead ends: 64 [2018-11-07 22:03:02,582 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 22:03:02,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 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-07 22:03:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 22:03:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2018-11-07 22:03:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 22:03:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 22:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-07 22:03:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:02,590 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 22:03:02,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:03:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 22:03:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 22:03:02,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:02,591 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:02,592 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:02,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1430451663, now seen corresponding path program 2 times [2018-11-07 22:03:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:02,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:03:02,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:02,709 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:02,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:02,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:02,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:02,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:02,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:03:02,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:02,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:03:02,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:03:02,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 22:03:02,936 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:03:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:03:02,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:02,937 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-07 22:03:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:03,135 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-07 22:03:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:03:03,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-07 22:03:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:03,137 INFO L225 Difference]: With dead ends: 76 [2018-11-07 22:03:03,137 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 22:03:03,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:03:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 22:03:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 22:03:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:03:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-07 22:03:03,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 36 [2018-11-07 22:03:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:03,146 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-07 22:03:03,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:03:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-07 22:03:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 22:03:03,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:03,148 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:03,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:03,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash -384882455, now seen corresponding path program 3 times [2018-11-07 22:03:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:03,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:03,305 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:03,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:03,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:03,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:03,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:03,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:03,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:03,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:03,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:03,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:03,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:03:03,665 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:03,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:03:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:03:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:03,666 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 8 states. [2018-11-07 22:03:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:03,931 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-07 22:03:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:03:03,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-07 22:03:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:03,934 INFO L225 Difference]: With dead ends: 93 [2018-11-07 22:03:03,934 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 22:03:03,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 22:03:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-11-07 22:03:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:03:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-07 22:03:03,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-07 22:03:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-07 22:03:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:03:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-07 22:03:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 22:03:03,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:03,945 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:03,946 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:03,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1720590010, now seen corresponding path program 4 times [2018-11-07 22:03:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:04,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:04,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:04,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,106 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:04,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:04,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:04,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 22:03:04,397 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:04,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:03:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:03:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:03:04,398 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-11-07 22:03:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:04,495 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-07 22:03:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:03:04,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-07 22:03:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:04,498 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:03:04,498 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 22:03:04,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 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-07 22:03:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 22:03:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-07 22:03:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 22:03:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 22:03:04,506 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2018-11-07 22:03:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 22:03:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:03:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 22:03:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 22:03:04,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:04,508 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:04,509 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:04,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1890900745, now seen corresponding path program 5 times [2018-11-07 22:03:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:03:05,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:05,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:05,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:05,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:05,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:05,156 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:05,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:03:05,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:05,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 22:03:05,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 22:03:05,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:05,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-07 22:03:05,460 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:05,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:03:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:03:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:03:05,462 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 11 states. [2018-11-07 22:03:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:05,601 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-07 22:03:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:03:05,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-07 22:03:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:05,603 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:03:05,603 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 22:03:05,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 22:03:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-07 22:03:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 22:03:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-07 22:03:05,613 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 63 [2018-11-07 22:03:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:05,613 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-07 22:03:05,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:03:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-07 22:03:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 22:03:05,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:05,615 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:05,615 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:05,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash -451564995, now seen corresponding path program 6 times [2018-11-07 22:03:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:05,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:05,767 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:05,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:05,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:05,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:05,779 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:05,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:05,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:05,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:05,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:06,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:06,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 22:03:06,052 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:06,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:03:06,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:03:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:06,053 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 11 states. [2018-11-07 22:03:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:06,180 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-07 22:03:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:03:06,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-07 22:03:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:06,186 INFO L225 Difference]: With dead ends: 132 [2018-11-07 22:03:06,187 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 22:03:06,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 22:03:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-11-07 22:03:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 22:03:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-07 22:03:06,196 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-11-07 22:03:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:06,196 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-07 22:03:06,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:03:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-07 22:03:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 22:03:06,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:06,198 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:06,198 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:06,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1062232128, now seen corresponding path program 7 times [2018-11-07 22:03:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:06,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:06,497 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:06,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:06,507 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:06,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:06,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:06,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 22:03:06,847 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:06,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:03:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:03:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:03:06,848 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 12 states. [2018-11-07 22:03:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:07,121 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-07 22:03:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:03:07,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-07 22:03:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:07,123 INFO L225 Difference]: With dead ends: 142 [2018-11-07 22:03:07,124 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:03:07,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 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-07 22:03:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:03:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-11-07 22:03:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 22:03:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-11-07 22:03:07,133 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2018-11-07 22:03:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:07,134 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-07 22:03:07,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:03:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-07 22:03:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 22:03:07,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:07,136 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:07,136 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:07,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash 798073885, now seen corresponding path program 8 times [2018-11-07 22:03:07,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:07,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:07,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:07,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:07,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:03:07,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:07,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:07,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:07,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:07,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:07,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:07,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:07,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:07,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:03:07,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:07,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 22:03:07,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 22:03:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:07,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-11-07 22:03:07,826 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:07,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:03:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:03:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:03:07,827 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 14 states. [2018-11-07 22:03:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:08,109 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-11-07 22:03:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:03:08,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-07 22:03:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:08,113 INFO L225 Difference]: With dead ends: 154 [2018-11-07 22:03:08,113 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 22:03:08,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 22:03:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-07 22:03:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 22:03:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-07 22:03:08,122 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 90 [2018-11-07 22:03:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-07 22:03:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:03:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-07 22:03:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 22:03:08,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:08,125 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:08,125 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:08,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1763815927, now seen corresponding path program 9 times [2018-11-07 22:03:08,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:08,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:08,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:09,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,148 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:09,148 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:09,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:09,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,148 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:09,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:09,158 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:09,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:09,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:09,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:09,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 22:03:10,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:10,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:03:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:03:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:10,144 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 14 states. [2018-11-07 22:03:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:10,609 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-11-07 22:03:10,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:03:10,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 22:03:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:10,611 INFO L225 Difference]: With dead ends: 171 [2018-11-07 22:03:10,612 INFO L226 Difference]: Without dead ends: 122 [2018-11-07 22:03:10,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-07 22:03:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2018-11-07 22:03:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 22:03:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-11-07 22:03:10,621 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2018-11-07 22:03:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:10,621 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-11-07 22:03:10,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:03:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-11-07 22:03:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 22:03:10,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:10,623 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:10,623 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:10,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1559061140, now seen corresponding path program 10 times [2018-11-07 22:03:10,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,624 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:11,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:11,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:11,709 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:11,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:11,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:11,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:11,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:11,719 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:11,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:11,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:12,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 22:03:12,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:12,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:03:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:03:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:12,108 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 15 states. [2018-11-07 22:03:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:12,307 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-11-07 22:03:12,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:03:12,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-07 22:03:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:12,308 INFO L225 Difference]: With dead ends: 181 [2018-11-07 22:03:12,308 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 22:03:12,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 22:03:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2018-11-07 22:03:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 22:03:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-07 22:03:12,322 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 112 [2018-11-07 22:03:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:12,322 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-07 22:03:12,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:03:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-07 22:03:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 22:03:12,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:12,328 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:12,328 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:12,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1893239831, now seen corresponding path program 11 times [2018-11-07 22:03:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:12,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:12,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:12,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:03:12,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:12,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:12,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:12,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:12,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:12,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:12,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:03:12,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:12,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 22:03:12,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 22:03:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-11-07 22:03:13,300 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:13,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:03:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:03:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:03:13,302 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 17 states. [2018-11-07 22:03:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:13,541 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-11-07 22:03:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:03:13,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2018-11-07 22:03:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:13,543 INFO L225 Difference]: With dead ends: 193 [2018-11-07 22:03:13,543 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 22:03:13,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 22:03:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-07 22:03:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 22:03:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-11-07 22:03:13,550 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 117 [2018-11-07 22:03:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:13,551 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-11-07 22:03:13,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:03:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-11-07 22:03:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 22:03:13,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:13,553 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:13,553 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:13,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1235713675, now seen corresponding path program 12 times [2018-11-07 22:03:13,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:13,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:13,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:13,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:13,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:13,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:13,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:13,849 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:13,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:13,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:13,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:13,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:14,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 22:03:14,459 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:14,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:03:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:03:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:14,460 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 17 states. [2018-11-07 22:03:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:14,721 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-11-07 22:03:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:03:14,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 134 [2018-11-07 22:03:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:14,722 INFO L225 Difference]: With dead ends: 210 [2018-11-07 22:03:14,722 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 22:03:14,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 22:03:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-07 22:03:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 22:03:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 22:03:14,728 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-11-07 22:03:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:14,729 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 22:03:14,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:03:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 22:03:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 22:03:14,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:14,730 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:14,730 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:14,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1270918194, now seen corresponding path program 13 times [2018-11-07 22:03:14,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:14,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:14,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:14,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:14,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:14,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:14,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:14,975 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:15,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:15,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:15,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 22:03:15,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:03:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:03:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:15,426 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 18 states. [2018-11-07 22:03:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:15,643 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-11-07 22:03:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:03:15,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-07 22:03:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:15,645 INFO L225 Difference]: With dead ends: 220 [2018-11-07 22:03:15,645 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 22:03:15,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 22:03:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2018-11-07 22:03:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-07 22:03:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-11-07 22:03:15,654 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-11-07 22:03:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:15,654 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-11-07 22:03:15,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:03:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-11-07 22:03:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 22:03:15,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:15,657 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:15,658 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:15,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 983126123, now seen corresponding path program 14 times [2018-11-07 22:03:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:03:15,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:15,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:15,926 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:15,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:15,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:15,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:15,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:15,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:16,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 22:03:16,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:16,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 22:03:16,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 22:03:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-11-07 22:03:16,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:16,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:03:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:03:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:03:16,668 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 20 states. [2018-11-07 22:03:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:16,874 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-11-07 22:03:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:03:16,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 144 [2018-11-07 22:03:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:16,876 INFO L225 Difference]: With dead ends: 232 [2018-11-07 22:03:16,876 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 22:03:16,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 22:03:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-11-07 22:03:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 22:03:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-11-07 22:03:16,882 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 144 [2018-11-07 22:03:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:16,883 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-11-07 22:03:16,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:03:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-11-07 22:03:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 22:03:16,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:16,884 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:16,884 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:16,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:16,884 INFO L82 PathProgramCache]: Analyzing trace with hash 853731589, now seen corresponding path program 15 times [2018-11-07 22:03:16,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:16,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:16,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:17,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:17,232 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:17,232 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:17,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:17,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:17,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:17,241 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:17,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:17,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:17,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:17,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:18,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:18,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 22:03:18,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:18,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:03:18,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:03:18,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:18,170 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 20 states. [2018-11-07 22:03:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:18,377 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-11-07 22:03:18,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:03:18,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-11-07 22:03:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:18,380 INFO L225 Difference]: With dead ends: 249 [2018-11-07 22:03:18,380 INFO L226 Difference]: Without dead ends: 176 [2018-11-07 22:03:18,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-07 22:03:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-11-07 22:03:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:03:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-07 22:03:18,386 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 161 [2018-11-07 22:03:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:18,387 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-07 22:03:18,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:03:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-07 22:03:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 22:03:18,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:18,388 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:18,389 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:18,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash -742202910, now seen corresponding path program 16 times [2018-11-07 22:03:18,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:18,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:18,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:18,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:18,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:18,879 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:18,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:18,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:18,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:18,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:18,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:18,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:18,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:19,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:19,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 22:03:19,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:19,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:03:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:03:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:19,408 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 21 states. [2018-11-07 22:03:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:19,631 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2018-11-07 22:03:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:03:19,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 166 [2018-11-07 22:03:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:19,633 INFO L225 Difference]: With dead ends: 259 [2018-11-07 22:03:19,633 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 22:03:19,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 22:03:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-11-07 22:03:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 22:03:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-07 22:03:19,639 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 166 [2018-11-07 22:03:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:19,639 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-07 22:03:19,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:03:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-07 22:03:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 22:03:19,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:19,641 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:19,641 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:19,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1858278619, now seen corresponding path program 17 times [2018-11-07 22:03:19,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:19,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:19,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:03:19,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:19,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:19,897 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:19,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:19,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:19,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:19,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:20,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 22:03:20,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:20,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 22:03:20,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 22:03:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:20,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-11-07 22:03:20,681 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:20,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:03:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:03:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:03:20,683 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 23 states. [2018-11-07 22:03:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:20,984 INFO L93 Difference]: Finished difference Result 271 states and 276 transitions. [2018-11-07 22:03:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:03:20,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2018-11-07 22:03:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:20,989 INFO L225 Difference]: With dead ends: 271 [2018-11-07 22:03:20,989 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 22:03:20,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 22:03:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-07 22:03:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 22:03:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-07 22:03:20,995 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 171 [2018-11-07 22:03:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:20,996 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-07 22:03:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:03:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-07 22:03:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 22:03:20,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:20,998 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:20,998 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:20,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 70537433, now seen corresponding path program 18 times [2018-11-07 22:03:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:20,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:21,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:21,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:21,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:21,740 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:21,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:21,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:21,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:21,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:21,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:21,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:21,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:21,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:21,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:22,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:22,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 22:03:22,537 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:22,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:03:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:03:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:22,538 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 23 states. [2018-11-07 22:03:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:22,929 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2018-11-07 22:03:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:03:22,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-11-07 22:03:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:22,933 INFO L225 Difference]: With dead ends: 288 [2018-11-07 22:03:22,933 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 22:03:22,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 22:03:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2018-11-07 22:03:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 22:03:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-11-07 22:03:22,941 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 188 [2018-11-07 22:03:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:22,941 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-11-07 22:03:22,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:03:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-11-07 22:03:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 22:03:22,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:22,943 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:22,943 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:22,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 864859612, now seen corresponding path program 19 times [2018-11-07 22:03:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:23,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:23,427 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:23,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:23,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:23,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:23,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:23,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:23,436 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:23,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:23,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:24,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:24,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 22:03:24,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:24,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:03:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:03:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:03:24,108 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 24 states. [2018-11-07 22:03:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:25,011 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2018-11-07 22:03:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:03:25,011 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 193 [2018-11-07 22:03:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:25,013 INFO L225 Difference]: With dead ends: 298 [2018-11-07 22:03:25,013 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 22:03:25,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 365 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-07 22:03:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 22:03:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2018-11-07 22:03:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 22:03:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-07 22:03:25,019 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 193 [2018-11-07 22:03:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:25,019 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-07 22:03:25,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:03:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-07 22:03:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 22:03:25,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:25,021 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:25,021 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:25,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 969538233, now seen corresponding path program 20 times [2018-11-07 22:03:25,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:03:25,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:25,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:25,382 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:25,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:25,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:25,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:25,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:25,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:25,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 22:03:25,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:25,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 22:03:26,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 22:03:27,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-07 22:03:27,650 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:27,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:03:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:03:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:27,651 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-07 22:03:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:28,109 INFO L93 Difference]: Finished difference Result 310 states and 315 transitions. [2018-11-07 22:03:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:03:28,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2018-11-07 22:03:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:28,112 INFO L225 Difference]: With dead ends: 310 [2018-11-07 22:03:28,112 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 22:03:28,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:03:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 22:03:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-11-07 22:03:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 22:03:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-11-07 22:03:28,119 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 198 [2018-11-07 22:03:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:28,119 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-11-07 22:03:28,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:03:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-11-07 22:03:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 22:03:28,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:28,121 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:28,121 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:28,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1495347693, now seen corresponding path program 21 times [2018-11-07 22:03:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:28,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:28,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:28,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:28,542 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:28,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:28,551 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:28,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:28,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:29,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:29,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:30,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 22:03:30,019 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:30,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:03:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:03:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:30,021 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 26 states. [2018-11-07 22:03:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:30,241 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-11-07 22:03:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:03:30,243 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2018-11-07 22:03:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:30,244 INFO L225 Difference]: With dead ends: 327 [2018-11-07 22:03:30,244 INFO L226 Difference]: Without dead ends: 230 [2018-11-07 22:03:30,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-07 22:03:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-11-07 22:03:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 22:03:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-11-07 22:03:30,251 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 215 [2018-11-07 22:03:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:30,251 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-11-07 22:03:30,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:03:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-11-07 22:03:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 22:03:30,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:30,253 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:30,253 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:30,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -354263248, now seen corresponding path program 22 times [2018-11-07 22:03:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:30,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:30,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:30,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:31,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:31,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:31,005 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:31,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:31,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:31,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:31,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:31,018 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:31,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:31,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:31,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 22:03:31,897 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:31,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:03:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:03:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:31,899 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 27 states. [2018-11-07 22:03:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:32,430 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-11-07 22:03:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:03:32,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2018-11-07 22:03:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:32,433 INFO L225 Difference]: With dead ends: 337 [2018-11-07 22:03:32,433 INFO L226 Difference]: Without dead ends: 240 [2018-11-07 22:03:32,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-07 22:03:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2018-11-07 22:03:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 22:03:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-11-07 22:03:32,442 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2018-11-07 22:03:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:32,442 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-11-07 22:03:32,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:03:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-11-07 22:03:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 22:03:32,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:32,444 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:32,444 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:32,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1357772851, now seen corresponding path program 23 times [2018-11-07 22:03:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:32,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:32,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:03:33,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:33,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:33,628 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:33,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:33,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:33,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:33,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:33,636 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:35,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 22:03:35,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:35,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 22:03:35,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 22:03:36,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:36,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-11-07 22:03:36,178 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:36,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:03:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:03:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 22:03:36,180 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 29 states. [2018-11-07 22:03:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:36,489 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-11-07 22:03:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:03:36,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 225 [2018-11-07 22:03:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:36,491 INFO L225 Difference]: With dead ends: 349 [2018-11-07 22:03:36,491 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 22:03:36,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 22:03:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-11-07 22:03:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-07 22:03:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-11-07 22:03:36,499 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 225 [2018-11-07 22:03:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:36,499 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-11-07 22:03:36,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:03:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-11-07 22:03:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 22:03:36,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:36,501 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:36,501 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:36,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -886300377, now seen corresponding path program 24 times [2018-11-07 22:03:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:36,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:36,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:36,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:36,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:36,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:36,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:37,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:38,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:38,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:38,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:38,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:40,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 22:03:40,695 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:03:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:03:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:40,697 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 29 states. [2018-11-07 22:03:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:41,212 INFO L93 Difference]: Finished difference Result 366 states and 369 transitions. [2018-11-07 22:03:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:03:41,213 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-07 22:03:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:41,214 INFO L225 Difference]: With dead ends: 366 [2018-11-07 22:03:41,214 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 22:03:41,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 22:03:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-11-07 22:03:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 22:03:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-11-07 22:03:41,222 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 242 [2018-11-07 22:03:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:41,222 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-11-07 22:03:41,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:03:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-11-07 22:03:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 22:03:41,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:41,224 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:41,224 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:41,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash -903625238, now seen corresponding path program 25 times [2018-11-07 22:03:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:41,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:41,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:43,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:43,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:43,505 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:43,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:43,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:43,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:43,515 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:43,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:43,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 22:03:44,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:44,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:03:44,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:03:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:44,736 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 30 states. [2018-11-07 22:03:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:45,026 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2018-11-07 22:03:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:03:45,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 247 [2018-11-07 22:03:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:45,029 INFO L225 Difference]: With dead ends: 376 [2018-11-07 22:03:45,029 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 22:03:45,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 22:03:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2018-11-07 22:03:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-07 22:03:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-11-07 22:03:45,036 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 247 [2018-11-07 22:03:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:45,036 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-11-07 22:03:45,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:03:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-11-07 22:03:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 22:03:45,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:45,038 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:45,038 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:45,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1257004281, now seen corresponding path program 26 times [2018-11-07 22:03:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:45,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:45,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:03:45,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:45,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:45,833 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:45,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:45,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:45,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:45,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:46,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 22:03:46,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:46,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 22:03:47,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 22:03:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-11-07 22:03:48,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:48,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:03:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:03:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 22:03:48,127 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 32 states. [2018-11-07 22:03:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:48,658 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2018-11-07 22:03:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:03:48,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 252 [2018-11-07 22:03:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:48,661 INFO L225 Difference]: With dead ends: 388 [2018-11-07 22:03:48,661 INFO L226 Difference]: Without dead ends: 274 [2018-11-07 22:03:48,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-07 22:03:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-11-07 22:03:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-07 22:03:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-11-07 22:03:48,667 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 252 [2018-11-07 22:03:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-11-07 22:03:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:03:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-11-07 22:03:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 22:03:48,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:48,670 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:48,670 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:48,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1121885919, now seen corresponding path program 27 times [2018-11-07 22:03:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:48,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:48,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:49,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:49,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:49,179 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:49,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:49,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:49,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:49,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:49,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:50,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:50,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:50,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:50,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:51,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:51,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 22:03:51,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:51,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:03:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:03:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:51,706 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 32 states. [2018-11-07 22:03:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:52,025 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-11-07 22:03:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:03:52,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 269 [2018-11-07 22:03:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:52,028 INFO L225 Difference]: With dead ends: 405 [2018-11-07 22:03:52,028 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 22:03:52,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 22:03:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 275. [2018-11-07 22:03:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-07 22:03:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-11-07 22:03:52,035 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2018-11-07 22:03:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:52,035 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-11-07 22:03:52,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:03:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-11-07 22:03:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 22:03:52,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:52,037 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:52,037 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:52,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1941691006, now seen corresponding path program 28 times [2018-11-07 22:03:52,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:52,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:52,604 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:52,604 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:52,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:52,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:52,604 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:52,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:52,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:52,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:54,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:54,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 22:03:54,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:54,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:03:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:03:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:54,131 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 33 states. [2018-11-07 22:03:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:54,471 INFO L93 Difference]: Finished difference Result 415 states and 419 transitions. [2018-11-07 22:03:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:03:54,473 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 274 [2018-11-07 22:03:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:54,474 INFO L225 Difference]: With dead ends: 415 [2018-11-07 22:03:54,474 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 22:03:54,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 22:03:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2018-11-07 22:03:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-07 22:03:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-11-07 22:03:54,481 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2018-11-07 22:03:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:54,481 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-11-07 22:03:54,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:03:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-11-07 22:03:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 22:03:54,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:54,483 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:54,483 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:54,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash -428362943, now seen corresponding path program 29 times [2018-11-07 22:03:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:54,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:03:56,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:56,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:56,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:56,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:56,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:56,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:56,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:56,118 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:59,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 22:03:59,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:59,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 22:03:59,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 22:04:00,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:00,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-11-07 22:04:00,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:00,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:04:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:04:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:04:00,837 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 35 states. [2018-11-07 22:04:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:01,185 INFO L93 Difference]: Finished difference Result 427 states and 432 transitions. [2018-11-07 22:04:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:04:01,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 279 [2018-11-07 22:04:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:01,187 INFO L225 Difference]: With dead ends: 427 [2018-11-07 22:04:01,187 INFO L226 Difference]: Without dead ends: 301 [2018-11-07 22:04:01,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:04:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-07 22:04:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-11-07 22:04:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-07 22:04:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-07 22:04:01,194 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 279 [2018-11-07 22:04:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:01,194 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-07 22:04:01,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:04:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-07 22:04:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 22:04:01,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:01,195 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:01,196 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:01,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:01,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1501491061, now seen corresponding path program 30 times [2018-11-07 22:04:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:01,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:01,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:01,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:01,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:01,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:01,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:01,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:01,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:01,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:01,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:04,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:04,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:04,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:04,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:05,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:05,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 22:04:05,637 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:04:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:04:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:04:05,639 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 35 states. [2018-11-07 22:04:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:06,063 INFO L93 Difference]: Finished difference Result 444 states and 447 transitions. [2018-11-07 22:04:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:04:06,064 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 296 [2018-11-07 22:04:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:06,065 INFO L225 Difference]: With dead ends: 444 [2018-11-07 22:04:06,066 INFO L226 Difference]: Without dead ends: 311 [2018-11-07 22:04:06,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:04:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-07 22:04:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 302. [2018-11-07 22:04:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-07 22:04:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-11-07 22:04:06,073 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 296 [2018-11-07 22:04:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:06,073 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-11-07 22:04:06,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:04:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-11-07 22:04:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-07 22:04:06,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:06,075 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:06,075 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:06,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1693416456, now seen corresponding path program 31 times [2018-11-07 22:04:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:06,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:06,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:06,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:06,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:06,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:06,719 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:06,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:06,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:06,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:06,728 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:06,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:06,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:08,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:08,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 22:04:08,203 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:08,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:04:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:04:08,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:04:08,204 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 36 states. [2018-11-07 22:04:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:09,656 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-11-07 22:04:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:04:09,656 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 301 [2018-11-07 22:04:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:09,658 INFO L225 Difference]: With dead ends: 454 [2018-11-07 22:04:09,658 INFO L226 Difference]: Without dead ends: 321 [2018-11-07 22:04:09,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 569 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-07 22:04:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-07 22:04:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 307. [2018-11-07 22:04:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-07 22:04:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-07 22:04:09,665 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 301 [2018-11-07 22:04:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:09,665 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-07 22:04:09,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:04:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-07 22:04:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 22:04:09,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:09,668 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:09,668 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:09,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 417745237, now seen corresponding path program 32 times [2018-11-07 22:04:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:09,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:09,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:04:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:10,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:10,310 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:10,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:10,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:10,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:10,319 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:12,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 22:04:12,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:12,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 22:04:12,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 22:04:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:14,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-11-07 22:04:14,478 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:14,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:04:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:04:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 22:04:14,480 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 38 states. [2018-11-07 22:04:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:14,916 INFO L93 Difference]: Finished difference Result 466 states and 471 transitions. [2018-11-07 22:04:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:04:14,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-07 22:04:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:14,919 INFO L225 Difference]: With dead ends: 466 [2018-11-07 22:04:14,919 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 22:04:14,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 22:04:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-11-07 22:04:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-07 22:04:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-11-07 22:04:14,926 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 306 [2018-11-07 22:04:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:14,926 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-11-07 22:04:14,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:04:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-11-07 22:04:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 22:04:14,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:14,928 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:14,929 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:14,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -449404369, now seen corresponding path program 33 times [2018-11-07 22:04:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:14,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:14,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:15,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:15,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:15,647 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:15,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:15,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:15,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:15,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:15,655 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:23,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:23,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:23,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:24,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:25,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:25,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 22:04:25,637 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:25,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:04:25,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:04:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:25,639 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 38 states. [2018-11-07 22:04:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:26,090 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-11-07 22:04:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:04:26,090 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 323 [2018-11-07 22:04:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:26,091 INFO L225 Difference]: With dead ends: 483 [2018-11-07 22:04:26,091 INFO L226 Difference]: Without dead ends: 338 [2018-11-07 22:04:26,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-07 22:04:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2018-11-07 22:04:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-07 22:04:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-07 22:04:26,098 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 323 [2018-11-07 22:04:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:26,099 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-07 22:04:26,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:04:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-07 22:04:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 22:04:26,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:26,101 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:26,101 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:26,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1145000908, now seen corresponding path program 34 times [2018-11-07 22:04:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:26,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:26,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:26,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:26,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:26,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:26,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:26,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:26,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:26,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:26,790 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:26,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:26,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 22:04:28,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:28,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:04:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:04:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:28,471 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 39 states. [2018-11-07 22:04:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:28,914 INFO L93 Difference]: Finished difference Result 493 states and 497 transitions. [2018-11-07 22:04:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:04:28,914 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 328 [2018-11-07 22:04:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:28,916 INFO L225 Difference]: With dead ends: 493 [2018-11-07 22:04:28,916 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 22:04:28,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 22:04:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 334. [2018-11-07 22:04:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 22:04:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-11-07 22:04:28,923 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 328 [2018-11-07 22:04:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:28,924 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-11-07 22:04:28,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:04:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-11-07 22:04:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-07 22:04:28,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:28,926 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:28,926 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:28,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 535174223, now seen corresponding path program 35 times [2018-11-07 22:04:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:28,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:04:30,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:30,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:30,487 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:30,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:30,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:30,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:30,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:37,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 22:04:37,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:37,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 22:04:37,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 22:04:39,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-07 22:04:39,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:39,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:04:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:04:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:39,138 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 42 states. [2018-11-07 22:04:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:39,679 INFO L93 Difference]: Finished difference Result 505 states and 510 transitions. [2018-11-07 22:04:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:04:39,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 333 [2018-11-07 22:04:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:39,682 INFO L225 Difference]: With dead ends: 505 [2018-11-07 22:04:39,682 INFO L226 Difference]: Without dead ends: 355 [2018-11-07 22:04:39,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:04:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-07 22:04:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-11-07 22:04:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 22:04:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-11-07 22:04:39,689 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 333 [2018-11-07 22:04:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-11-07 22:04:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:04:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-11-07 22:04:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-07 22:04:39,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:39,692 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:39,692 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:39,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1902330941, now seen corresponding path program 36 times [2018-11-07 22:04:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:39,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:39,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:40,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:40,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:40,407 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:40,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:40,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:40,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:40,415 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:52,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:52,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:52,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:52,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:54,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 22:04:54,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:54,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:04:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:04:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:54,700 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 41 states. [2018-11-07 22:04:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:55,337 INFO L93 Difference]: Finished difference Result 522 states and 525 transitions. [2018-11-07 22:04:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:04:55,338 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 350 [2018-11-07 22:04:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:55,339 INFO L225 Difference]: With dead ends: 522 [2018-11-07 22:04:55,340 INFO L226 Difference]: Without dead ends: 365 [2018-11-07 22:04:55,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-07 22:04:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2018-11-07 22:04:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 22:04:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-11-07 22:04:55,346 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 350 [2018-11-07 22:04:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:55,347 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-11-07 22:04:55,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:04:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-11-07 22:04:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-11-07 22:04:55,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:55,349 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:55,349 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:55,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1088352262, now seen corresponding path program 37 times [2018-11-07 22:04:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:55,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:55,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:56,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:56,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:56,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:56,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:56,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:56,495 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:56,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:56,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:04:58,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:58,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 22:04:58,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:58,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:04:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:04:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:58,870 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 42 states. [2018-11-07 22:04:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:59,371 INFO L93 Difference]: Finished difference Result 532 states and 536 transitions. [2018-11-07 22:04:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:04:59,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 355 [2018-11-07 22:04:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:59,372 INFO L225 Difference]: With dead ends: 532 [2018-11-07 22:04:59,372 INFO L226 Difference]: Without dead ends: 375 [2018-11-07 22:04:59,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-07 22:04:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2018-11-07 22:04:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-07 22:04:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-11-07 22:04:59,380 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 355 [2018-11-07 22:04:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:59,380 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-11-07 22:04:59,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:04:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-11-07 22:04:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-07 22:04:59,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:59,383 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:59,383 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:59,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash -701370973, now seen corresponding path program 38 times [2018-11-07 22:04:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:59,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:59,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:05:00,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:00,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:00,455 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:00,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:00,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:00,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:00,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:05:00,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:05:15,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 22:05:15,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:15,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 22:05:15,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 22:05:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:17,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-07 22:05:17,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:17,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:05:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:05:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:05:17,388 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 45 states. [2018-11-07 22:05:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:17,894 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-11-07 22:05:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:05:17,894 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 360 [2018-11-07 22:05:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:17,897 INFO L225 Difference]: With dead ends: 544 [2018-11-07 22:05:17,897 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 22:05:17,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 22:05:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 22:05:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2018-11-07 22:05:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-07 22:05:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-11-07 22:05:17,904 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 360 [2018-11-07 22:05:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:17,905 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-11-07 22:05:17,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:05:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-11-07 22:05:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-07 22:05:17,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:17,907 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:17,907 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:17,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash -433417923, now seen corresponding path program 39 times [2018-11-07 22:05:17,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:17,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:17,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:18,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:18,739 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:18,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:18,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:18,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:05:18,748 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:05:30,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:05:30,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:30,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:30,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:32,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:32,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 22:05:32,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:32,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:05:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:05:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:05:32,893 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 44 states. [2018-11-07 22:05:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:33,415 INFO L93 Difference]: Finished difference Result 561 states and 564 transitions. [2018-11-07 22:05:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:05:33,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 377 [2018-11-07 22:05:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:33,417 INFO L225 Difference]: With dead ends: 561 [2018-11-07 22:05:33,417 INFO L226 Difference]: Without dead ends: 392 [2018-11-07 22:05:33,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:05:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-07 22:05:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2018-11-07 22:05:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 22:05:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-11-07 22:05:33,423 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 377 [2018-11-07 22:05:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:33,423 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-11-07 22:05:33,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:05:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-11-07 22:05:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-07 22:05:33,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:33,425 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:33,426 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:33,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1457310490, now seen corresponding path program 40 times [2018-11-07 22:05:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:33,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:33,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:34,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:34,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:34,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:34,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:34,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:05:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:34,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:34,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:36,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:36,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 22:05:36,627 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:36,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:05:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:05:36,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:36,629 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 45 states. [2018-11-07 22:05:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:37,162 INFO L93 Difference]: Finished difference Result 571 states and 575 transitions. [2018-11-07 22:05:37,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:05:37,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 382 [2018-11-07 22:05:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:37,164 INFO L225 Difference]: With dead ends: 571 [2018-11-07 22:05:37,165 INFO L226 Difference]: Without dead ends: 402 [2018-11-07 22:05:37,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-07 22:05:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2018-11-07 22:05:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 22:05:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 389 transitions. [2018-11-07 22:05:37,171 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 389 transitions. Word has length 382 [2018-11-07 22:05:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:37,172 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 389 transitions. [2018-11-07 22:05:37,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:05:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 389 transitions. [2018-11-07 22:05:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-07 22:05:37,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:37,174 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:37,175 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:37,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1120219997, now seen corresponding path program 41 times [2018-11-07 22:05:37,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:37,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:05:38,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:38,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:38,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:38,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:38,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:38,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:05:38,134 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:05:54,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 22:05:54,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:54,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 22:05:54,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 22:05:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-07 22:05:57,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:57,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:05:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:05:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:05:57,094 INFO L87 Difference]: Start difference. First operand 388 states and 389 transitions. Second operand 48 states. [2018-11-07 22:05:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:57,590 INFO L93 Difference]: Finished difference Result 583 states and 588 transitions. [2018-11-07 22:05:57,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:05:57,590 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 387 [2018-11-07 22:05:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:57,593 INFO L225 Difference]: With dead ends: 583 [2018-11-07 22:05:57,593 INFO L226 Difference]: Without dead ends: 409 [2018-11-07 22:05:57,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:05:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-07 22:05:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2018-11-07 22:05:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 22:05:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-11-07 22:05:57,600 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 387 [2018-11-07 22:05:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:57,600 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-11-07 22:05:57,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:05:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-11-07 22:05:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-07 22:05:57,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:57,603 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:57,603 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:57,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1904900591, now seen corresponding path program 42 times [2018-11-07 22:05:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:57,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:57,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:05:58,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:58,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:58,606 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:58,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:58,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:58,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:58,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:05:58,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:10,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:10,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:10,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:10,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:13,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 22:06:13,269 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:13,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:06:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:06:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:06:13,270 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 47 states. [2018-11-07 22:06:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:13,962 INFO L93 Difference]: Finished difference Result 600 states and 603 transitions. [2018-11-07 22:06:13,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:06:13,963 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 404 [2018-11-07 22:06:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:13,964 INFO L225 Difference]: With dead ends: 600 [2018-11-07 22:06:13,964 INFO L226 Difference]: Without dead ends: 419 [2018-11-07 22:06:13,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:06:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-07 22:06:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2018-11-07 22:06:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-11-07 22:06:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-11-07 22:06:13,969 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 404 [2018-11-07 22:06:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:13,969 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-11-07 22:06:13,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:06:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-11-07 22:06:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-07 22:06:13,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:13,972 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:13,972 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:13,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1382348268, now seen corresponding path program 43 times [2018-11-07 22:06:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:13,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:13,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:15,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:15,269 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:15,269 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:15,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:15,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:15,269 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:15,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:15,278 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:15,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:15,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:17,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:17,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 22:06:17,980 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:06:17,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:06:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:17,982 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 48 states. [2018-11-07 22:06:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:18,646 INFO L93 Difference]: Finished difference Result 610 states and 614 transitions. [2018-11-07 22:06:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:06:18,646 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 409 [2018-11-07 22:06:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:18,648 INFO L225 Difference]: With dead ends: 610 [2018-11-07 22:06:18,648 INFO L226 Difference]: Without dead ends: 429 [2018-11-07 22:06:18,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-07 22:06:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 415. [2018-11-07 22:06:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-07 22:06:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-11-07 22:06:18,655 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 409 [2018-11-07 22:06:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:18,656 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-11-07 22:06:18,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:06:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-11-07 22:06:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-07 22:06:18,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:18,658 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:18,659 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:18,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2107207695, now seen corresponding path program 44 times [2018-11-07 22:06:18,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:18,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:18,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:18,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:18,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:06:19,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:19,722 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:19,723 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:19,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:19,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:19,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:19,734 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:44,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-07 22:06:44,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:44,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 22:06:45,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 22:06:47,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:47,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-11-07 22:06:47,333 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:47,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:06:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:06:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 22:06:47,334 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 50 states. [2018-11-07 22:06:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:47,922 INFO L93 Difference]: Finished difference Result 622 states and 627 transitions. [2018-11-07 22:06:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:06:47,923 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 414 [2018-11-07 22:06:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:47,926 INFO L225 Difference]: With dead ends: 622 [2018-11-07 22:06:47,926 INFO L226 Difference]: Without dead ends: 436 [2018-11-07 22:06:47,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:06:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-07 22:06:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2018-11-07 22:06:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-07 22:06:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2018-11-07 22:06:47,933 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 414 [2018-11-07 22:06:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:47,934 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2018-11-07 22:06:47,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:06:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2018-11-07 22:06:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-11-07 22:06:47,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:47,937 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:47,937 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:47,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1098305973, now seen corresponding path program 45 times [2018-11-07 22:06:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:47,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:47,938 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:06:48,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:48,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:48,992 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:48,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:48,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:48,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:49,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:49,001 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:07:01,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:01,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:01,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:07:01,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:07:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 22:07:03,984 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:03,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:07:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:07:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:07:03,985 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 50 states. [2018-11-07 22:07:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:04,807 INFO L93 Difference]: Finished difference Result 639 states and 642 transitions. [2018-11-07 22:07:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:07:04,808 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 431 [2018-11-07 22:07:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:04,809 INFO L225 Difference]: With dead ends: 639 [2018-11-07 22:07:04,809 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 22:07:04,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:07:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 22:07:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2018-11-07 22:07:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-07 22:07:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-11-07 22:07:04,817 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 431 [2018-11-07 22:07:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:04,817 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-11-07 22:07:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:07:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-11-07 22:07:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-07 22:07:04,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:04,820 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:04,820 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:04,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -360431512, now seen corresponding path program 46 times [2018-11-07 22:07:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:04,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:04,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:04,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:04,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:07:06,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:06,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:06,103 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:06,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:06,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:06,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:06,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:06,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:06,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:07:06,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 22:07:09,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:09,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-11-07 22:07:09,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:09,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:07:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:07:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 22:07:09,092 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 51 states. Received shutdown request... [2018-11-07 22:07:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:07:09,813 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:07:09,819 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:07:09,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:07:09 BoogieIcfgContainer [2018-11-07 22:07:09,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:07:09,820 INFO L168 Benchmark]: Toolchain (without parser) took 251255.73 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.1 MB). Peak memory consumption was 486.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:09,821 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:07:09,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:09,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:07:09,822 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:07:09,823 INFO L168 Benchmark]: RCFGBuilder took 516.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:09,823 INFO L168 Benchmark]: TraceAbstraction took 250390.47 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 290.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.7 MB). Peak memory consumption was 513.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:09,828 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.28 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 25.09 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 28.24 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 516.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250390.47 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 290.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.7 MB). Peak memory consumption was 513.1 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 (437states) and FLOYD_HOARE automaton (currently 50 states, 51 states before enhancement),while ReachableStatesComputation was computing reachable states (608 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 250.3s OverallTime, 50 OverallIterations, 48 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 795 SDtfs, 8361 SDslu, 11516 SDs, 0 SdLazy, 9599 SolverSat, 1693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22827 GetRequests, 20384 SyntacticMatches, 0 SemanticMatches, 2443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 80.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 49 MinimizatonAttempts, 427 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 136.7s SatisfiabilityAnalysisTime, 87.5s InterpolantComputationTime, 21611 NumberOfCodeBlocks, 21451 NumberOfCodeBlocksAsserted, 443 NumberOfCheckSat, 32255 ConstructedInterpolants, 0 QuantifiedInterpolants, 19160257 SizeOfPredicates, 76 NumberOfNonLiveVariables, 18895 ConjunctsInSsa, 1308 ConjunctsInUnsatCore, 146 InterpolantComputations, 4 PerfectInterpolantSequences, 220347/470904 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown