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-EXP.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:40:11,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:40:11,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:40:11,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:40:11,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:40:11,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:40:11,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:40:11,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:40:11,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:40:11,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:40:11,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:40:11,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:40:11,954 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:40:11,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:40:11,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:40:11,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:40:11,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:40:11,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:40:11,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:40:11,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:40:11,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:40:11,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:40:11,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:40:11,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:40:11,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:40:11,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:40:11,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:40:11,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:40:11,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:40:11,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:40:11,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:40:11,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:40:11,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:40:11,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:40:11,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:40:11,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:40:11,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:40:12,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:40:12,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:40:12,001 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:40:12,001 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:40:12,001 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:40:12,002 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:40:12,002 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:40:12,002 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:40:12,002 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:40:12,002 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:40:12,003 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:40:12,003 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:40:12,003 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:40:12,003 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:40:12,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:40:12,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:40:12,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:40:12,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:40:12,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:40:12,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:40:12,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:40:12,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:40:12,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:40:12,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:40:12,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:40:12,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:40:12,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:40:12,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:40:12,007 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:40:12,008 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:40:12,008 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:40:12,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:40:12,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:40:12,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:40:12,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:40:12,093 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:40:12,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-07 10:40:12,158 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85110e57/96df04bca5de4e29bbe608b0af454ac8/FLAG3b41d98b6 [2018-11-07 10:40:12,576 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:40:12,577 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-07 10:40:12,583 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85110e57/96df04bca5de4e29bbe608b0af454ac8/FLAG3b41d98b6 [2018-11-07 10:40:12,597 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85110e57/96df04bca5de4e29bbe608b0af454ac8 [2018-11-07 10:40:12,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:40:12,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:40:12,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:12,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:40:12,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:40:12,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32eda060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12, skipping insertion in model container [2018-11-07 10:40:12,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:40:12,652 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:40:12,874 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:12,880 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:40:12,920 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:12,934 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:40:12,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12 WrapperNode [2018-11-07 10:40:12,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:12,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:12,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:40:12,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:40:12,943 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:40:12" (1/1) ... [2018-11-07 10:40:12,949 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:40:12" (1/1) ... [2018-11-07 10:40:12,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:12,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:40:12,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:40:12,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:40:12,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (1/1) ... [2018-11-07 10:40:12,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:40:12,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:40:12,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:40:12,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:40:12,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (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 10:40:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:40:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:40:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:40:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:40:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:40:13,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:40:13,596 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:40:13,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:13 BoogieIcfgContainer [2018-11-07 10:40:13,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:40:13,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:40:13,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:40:13,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:40:13,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:40:12" (1/3) ... [2018-11-07 10:40:13,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f226733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:13, skipping insertion in model container [2018-11-07 10:40:13,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:12" (2/3) ... [2018-11-07 10:40:13,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f226733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:13, skipping insertion in model container [2018-11-07 10:40:13,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:13" (3/3) ... [2018-11-07 10:40:13,609 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-07 10:40:13,618 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:40:13,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:40:13,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:40:13,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:40:13,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:40:13,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:40:13,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:40:13,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:40:13,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:40:13,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:40:13,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:40:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-07 10:40:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:13,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:13,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:13,704 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:13,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2018-11-07 10:40:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:13,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:13,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:13,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:13,896 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 10:40:13,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:13,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:40:13,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:13,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:40:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:40:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:13,921 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-07 10:40:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:14,486 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-07 10:40:14,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:40:14,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-07 10:40:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:14,500 INFO L225 Difference]: With dead ends: 74 [2018-11-07 10:40:14,500 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 10:40:14,504 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 10:40:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 10:40:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-07 10:40:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 10:40:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-07 10:40:14,544 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2018-11-07 10:40:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:14,545 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-07 10:40:14,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:40:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-07 10:40:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:14,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:14,547 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:14,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:14,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2018-11-07 10:40:14,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:14,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:14,686 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 10:40:14,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:14,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:40:14,688 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:14,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:40:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:40:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:40:14,690 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2018-11-07 10:40:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:14,944 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-07 10:40:14,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:40:14,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 10:40:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:14,947 INFO L225 Difference]: With dead ends: 62 [2018-11-07 10:40:14,947 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 10:40:14,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:40:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 10:40:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-07 10:40:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 10:40:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-07 10:40:14,957 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2018-11-07 10:40:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:14,957 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-07 10:40:14,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:40:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-07 10:40:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:14,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:14,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:14,959 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:14,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2018-11-07 10:40:14,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:14,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:15,056 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 10:40:15,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:15,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:40:15,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:15,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:40:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:40:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:40:15,059 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2018-11-07 10:40:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:15,376 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-07 10:40:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:40:15,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-07 10:40:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:15,378 INFO L225 Difference]: With dead ends: 52 [2018-11-07 10:40:15,379 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:40:15,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:40:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:40:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 10:40:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:40:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-07 10:40:15,392 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2018-11-07 10:40:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:15,394 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-07 10:40:15,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:40:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-07 10:40:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:15,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:15,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:15,397 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:15,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2018-11-07 10:40:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:15,691 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 10:40:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-07 10:40:15,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:15,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:40:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:40:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:40:15,693 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2018-11-07 10:40:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:15,847 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-07 10:40:15,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:40:15,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-07 10:40:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:15,849 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:40:15,849 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:40:15,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:40:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:40:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:40:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:40:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-07 10:40:15,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2018-11-07 10:40:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:15,857 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-07 10:40:15,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:40:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-07 10:40:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:15,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:15,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:15,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:15,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2018-11-07 10:40:15,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:15,910 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 10:40:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:40:15,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:15,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:40:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:40:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:15,912 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-11-07 10:40:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:15,999 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 10:40:15,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:40:15,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-07 10:40:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:16,001 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:40:16,001 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:40:16,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:40:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:40:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:40:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 10:40:16,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-11-07 10:40:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 10:40:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:40:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 10:40:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:40:16,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:16,009 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:16,009 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:16,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2018-11-07 10:40:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:16,182 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 10:40:16,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:16,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-07 10:40:16,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:16,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:40:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:40:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:40:16,185 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2018-11-07 10:40:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:16,302 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-07 10:40:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:40:16,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 10:40:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:16,304 INFO L225 Difference]: With dead ends: 36 [2018-11-07 10:40:16,305 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:40:16,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:40:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:40:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:40:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:40:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-07 10:40:16,310 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-11-07 10:40:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:16,311 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-07 10:40:16,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:40:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-07 10:40:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:40:16,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:16,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:16,313 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:16,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2018-11-07 10:40:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:16,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:16,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:16,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-07 10:40:16,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:16,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:40:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:40:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:40:16,513 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-07 10:40:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:16,698 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-07 10:40:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:40:16,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 10:40:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:16,700 INFO L225 Difference]: With dead ends: 38 [2018-11-07 10:40:16,700 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:40:16,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:40:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:40:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 10:40:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:40:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-07 10:40:16,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2018-11-07 10:40:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:16,708 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-07 10:40:16,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:40:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-07 10:40:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:40:16,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:16,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:16,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:16,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2018-11-07 10:40:16,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:16,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:16,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:16,883 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 10:40:16,885 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [77], [79], [82], [83], [114], [115], [116] [2018-11-07 10:40:16,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:40:16,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:40:17,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:40:17,200 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-07 10:40:17,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:17,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:40:17,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:17,251 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 10:40:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:17,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:17,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:17,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:17,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 10:40:17,832 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:17,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:40:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:40:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:40:17,833 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2018-11-07 10:40:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:17,944 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-07 10:40:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:40:17,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 10:40:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:17,945 INFO L225 Difference]: With dead ends: 40 [2018-11-07 10:40:17,945 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 10:40:17,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:40:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 10:40:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-07 10:40:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:40:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-07 10:40:17,951 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2018-11-07 10:40:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:17,951 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-07 10:40:17,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:40:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-07 10:40:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 10:40:17,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:17,953 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:17,953 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:17,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:17,954 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2018-11-07 10:40:17,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:17,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:17,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:17,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:17,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:18,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:18,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:18,274 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:18,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:18,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:18,274 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 10:40:18,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:18,283 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:18,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:40:18,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:18,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:18,713 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 10:40:18,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:19,514 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 10:40:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2018-11-07 10:40:19,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:19,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:40:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:40:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:19,537 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 26 states. [2018-11-07 10:40:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:19,888 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-07 10:40:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:40:19,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-07 10:40:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:19,890 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:40:19,890 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 10:40:19,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 10:40:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-07 10:40:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 10:40:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-07 10:40:19,898 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 33 [2018-11-07 10:40:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:19,899 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-07 10:40:19,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:40:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-07 10:40:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 10:40:19,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:19,901 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:19,901 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:19,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1917273006, now seen corresponding path program 3 times [2018-11-07 10:40:19,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:19,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:19,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:20,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:20,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:20,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 10:40:20,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,109 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 10:40:20,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:20,118 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:20,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:20,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:20,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:20,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 10:40:20,583 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:20,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:40:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:40:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:40:20,585 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 15 states. [2018-11-07 10:40:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:20,737 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-07 10:40:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:40:20,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-07 10:40:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:20,739 INFO L225 Difference]: With dead ends: 86 [2018-11-07 10:40:20,740 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 10:40:20,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:40:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 10:40:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 10:40:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:40:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-07 10:40:20,751 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-11-07 10:40:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:20,752 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-07 10:40:20,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:40:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-07 10:40:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:40:20,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:20,754 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:20,754 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:20,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 798282511, now seen corresponding path program 4 times [2018-11-07 10:40:20,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:20,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:20,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:20,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:20,986 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:20,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:20,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,986 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 10:40:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:20,996 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:21,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:21,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:21,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:21,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 10:40:21,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:21,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:40:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:40:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:40:21,786 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 16 states. [2018-11-07 10:40:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:21,971 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-07 10:40:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:40:21,972 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-11-07 10:40:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:21,973 INFO L225 Difference]: With dead ends: 88 [2018-11-07 10:40:21,973 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 10:40:21,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:40:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 10:40:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-07 10:40:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 10:40:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-07 10:40:21,979 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2018-11-07 10:40:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:21,980 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-07 10:40:21,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:40:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-07 10:40:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:40:21,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:21,981 INFO L375 BasicCegarLoop]: trace histogram [17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:21,981 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:21,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash -892981620, now seen corresponding path program 5 times [2018-11-07 10:40:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:21,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:21,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:22,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:22,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:22,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:22,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:22,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:22,411 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 10:40:22,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:22,420 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:22,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 10:40:22,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:22,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:22,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 10:40:22,881 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:40:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:40:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:40:22,882 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 17 states. [2018-11-07 10:40:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:23,200 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-07 10:40:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:40:23,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-11-07 10:40:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:23,202 INFO L225 Difference]: With dead ends: 90 [2018-11-07 10:40:23,202 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 10:40:23,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:40:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 10:40:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-07 10:40:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 10:40:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 10:40:23,218 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2018-11-07 10:40:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:23,219 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 10:40:23,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:40:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 10:40:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 10:40:23,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:23,220 INFO L375 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:23,220 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:23,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1594793673, now seen corresponding path program 6 times [2018-11-07 10:40:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:23,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:23,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:23,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:23,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:23,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:23,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:23,541 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:23,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:23,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:23,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:23,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:24,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:24,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 10:40:24,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:24,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:40:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:40:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:40:24,102 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 18 states. [2018-11-07 10:40:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:24,314 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-07 10:40:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:40:24,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-11-07 10:40:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:24,316 INFO L225 Difference]: With dead ends: 92 [2018-11-07 10:40:24,316 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:40:24,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:40:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:40:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 10:40:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:40:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-07 10:40:24,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-11-07 10:40:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:24,322 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-07 10:40:24,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:40:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-07 10:40:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:40:24,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:24,324 INFO L375 BasicCegarLoop]: trace histogram [19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:24,324 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:24,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 50066374, now seen corresponding path program 7 times [2018-11-07 10:40:24,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:24,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:24,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:24,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:24,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:24,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:24,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:24,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:24,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:24,668 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 10:40:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:24,678 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:24,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:24,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:25,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:25,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 10:40:25,132 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:25,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:40:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:40:25,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:40:25,133 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 19 states. [2018-11-07 10:40:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:25,691 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-07 10:40:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:40:25,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-11-07 10:40:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:25,692 INFO L225 Difference]: With dead ends: 94 [2018-11-07 10:40:25,692 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 10:40:25,693 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:40:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 10:40:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-07 10:40:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:40:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-07 10:40:25,699 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2018-11-07 10:40:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:25,699 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-07 10:40:25,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:40:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-07 10:40:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 10:40:25,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:25,700 INFO L375 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:25,701 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:25,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1625816451, now seen corresponding path program 8 times [2018-11-07 10:40:25,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:25,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:26,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:26,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:26,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:26,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:26,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:26,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-07 10:40:26,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:26,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:26,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:27,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:27,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 10:40:27,132 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:27,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:40:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:40:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:27,133 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2018-11-07 10:40:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:27,302 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-07 10:40:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:40:27,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-11-07 10:40:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:27,303 INFO L225 Difference]: With dead ends: 96 [2018-11-07 10:40:27,303 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:40:27,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:40:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-07 10:40:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 10:40:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-07 10:40:27,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2018-11-07 10:40:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:27,311 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-07 10:40:27,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:40:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-07 10:40:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:40:27,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:27,312 INFO L375 BasicCegarLoop]: trace histogram [21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:27,313 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:27,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -201815040, now seen corresponding path program 9 times [2018-11-07 10:40:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:27,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:27,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:27,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:27,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:27,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:27,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:27,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:27,728 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 10:40:27,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:27,737 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:27,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:27,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:27,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:28,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:28,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 10:40:28,688 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:40:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:40:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:40:28,689 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2018-11-07 10:40:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:28,808 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-07 10:40:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:40:28,808 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-07 10:40:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:28,809 INFO L225 Difference]: With dead ends: 98 [2018-11-07 10:40:28,809 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 10:40:28,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:40:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 10:40:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-07 10:40:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:40:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-07 10:40:28,815 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-11-07 10:40:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:28,816 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-07 10:40:28,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:40:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-07 10:40:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:40:28,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:28,817 INFO L375 BasicCegarLoop]: trace histogram [22, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:28,817 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:28,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 85946173, now seen corresponding path program 10 times [2018-11-07 10:40:28,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:28,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:28,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:29,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:29,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:29,628 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:29,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 10:40:29,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:29,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 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 10:40:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:29,637 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:29,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:29,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 10:40:30,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:30,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:40:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:40:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:40:30,436 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2018-11-07 10:40:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:30,593 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-07 10:40:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:40:30,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-07 10:40:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:30,595 INFO L225 Difference]: With dead ends: 100 [2018-11-07 10:40:30,595 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 10:40:30,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:40:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 10:40:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-07 10:40:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 10:40:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-07 10:40:30,601 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2018-11-07 10:40:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:30,601 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-07 10:40:30,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:40:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-07 10:40:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 10:40:30,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:30,602 INFO L375 BasicCegarLoop]: trace histogram [23, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:30,603 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:30,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:30,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1746564922, now seen corresponding path program 11 times [2018-11-07 10:40:30,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:30,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:30,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:30,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:30,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:30,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:30,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:30,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:30,976 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 10:40:30,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:30,985 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:31,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 10:40:31,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:31,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:31,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:31,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:31,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 10:40:31,622 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:31,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:40:31,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:40:31,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:40:31,624 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2018-11-07 10:40:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:31,907 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-07 10:40:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:40:31,907 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-07 10:40:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:31,908 INFO L225 Difference]: With dead ends: 102 [2018-11-07 10:40:31,908 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:40:31,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:40:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:40:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-07 10:40:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:40:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-07 10:40:31,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2018-11-07 10:40:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:31,914 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-07 10:40:31,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:40:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-07 10:40:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-07 10:40:31,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:31,915 INFO L375 BasicCegarLoop]: trace histogram [24, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:31,916 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:31,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -126651401, now seen corresponding path program 12 times [2018-11-07 10:40:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:31,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:31,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:32,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:32,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:32,202 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:32,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:32,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:32,202 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 10:40:32,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:32,211 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:32,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:32,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:32,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:32,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:33,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:33,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 10:40:33,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:33,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:40:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:40:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:40:33,207 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2018-11-07 10:40:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:33,387 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-07 10:40:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:40:33,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-11-07 10:40:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:33,388 INFO L225 Difference]: With dead ends: 104 [2018-11-07 10:40:33,388 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 10:40:33,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:40:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 10:40:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 10:40:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:40:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-07 10:40:33,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-11-07 10:40:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:33,393 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-07 10:40:33,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:40:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-07 10:40:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:40:33,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:33,394 INFO L375 BasicCegarLoop]: trace histogram [25, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:33,394 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:33,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -696240780, now seen corresponding path program 13 times [2018-11-07 10:40:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:33,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:33,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:33,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:33,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:33,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:33,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:33,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:33,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:33,894 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:33,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:33,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:34,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:34,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 10:40:34,583 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:34,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:40:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:40:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:40:34,584 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-11-07 10:40:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:34,717 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-11-07 10:40:34,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:40:34,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 10:40:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:34,718 INFO L225 Difference]: With dead ends: 106 [2018-11-07 10:40:34,718 INFO L226 Difference]: Without dead ends: 80 [2018-11-07 10:40:34,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:40:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-07 10:40:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-07 10:40:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-07 10:40:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-07 10:40:34,722 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2018-11-07 10:40:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:34,722 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-07 10:40:34,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:40:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-07 10:40:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:40:34,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:34,723 INFO L375 BasicCegarLoop]: trace histogram [26, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:34,724 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:34,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179889, now seen corresponding path program 14 times [2018-11-07 10:40:34,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:34,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:34,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:34,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:34,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 345 proven. 210 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-07 10:40:35,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:35,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:35,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:35,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:35,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:35,050 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 10:40:35,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:35,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:35,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 10:40:35,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:35,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-07 10:40:35,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-07 10:40:35,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:35,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 52 [2018-11-07 10:40:35,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:35,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:40:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:40:35,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:35,872 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2018-11-07 10:40:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:36,089 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-11-07 10:40:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2018-11-07 10:40:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:36,091 INFO L225 Difference]: With dead ends: 111 [2018-11-07 10:40:36,091 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:40:36,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:40:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 10:40:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 10:40:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-07 10:40:36,097 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2018-11-07 10:40:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:36,098 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-07 10:40:36,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:40:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-07 10:40:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 10:40:36,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:36,099 INFO L375 BasicCegarLoop]: trace histogram [28, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:36,099 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:36,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764232, now seen corresponding path program 15 times [2018-11-07 10:40:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:36,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:36,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:36,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:36,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:36,478 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:36,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:36,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:36,478 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 10:40:36,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:36,489 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:36,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:36,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:36,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:36,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:37,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:37,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 10:40:37,256 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:37,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:40:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:40:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:37,257 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 27 states. [2018-11-07 10:40:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:37,431 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-07 10:40:37,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:40:37,434 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 10:40:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:37,435 INFO L225 Difference]: With dead ends: 114 [2018-11-07 10:40:37,435 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 10:40:37,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 10:40:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-07 10:40:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 10:40:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-07 10:40:37,440 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2018-11-07 10:40:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:37,440 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-07 10:40:37,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:40:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-07 10:40:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 10:40:37,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:37,441 INFO L375 BasicCegarLoop]: trace histogram [29, 16, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:37,441 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1891909893, now seen corresponding path program 16 times [2018-11-07 10:40:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:37,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:37,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:38,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:38,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:38,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:38,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:38,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:38,629 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 10:40:38,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:38,639 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:38,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:38,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:39,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:39,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-11-07 10:40:39,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:39,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:40:39,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:40:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:39,747 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2018-11-07 10:40:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:39,993 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-11-07 10:40:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:40:39,993 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-07 10:40:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:39,995 INFO L225 Difference]: With dead ends: 116 [2018-11-07 10:40:39,995 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 10:40:39,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 10:40:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-07 10:40:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 10:40:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-07 10:40:40,001 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2018-11-07 10:40:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:40,002 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-07 10:40:40,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:40:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-07 10:40:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 10:40:40,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:40,003 INFO L375 BasicCegarLoop]: trace histogram [30, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:40,003 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:40,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1312754242, now seen corresponding path program 17 times [2018-11-07 10:40:40,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:40,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:40,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 306 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:40:40,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:40,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:40,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:40,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,571 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 10:40:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:40,580 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:40,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-07 10:40:40,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:40,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-07 10:40:40,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-07 10:40:41,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:41,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 16] total 57 [2018-11-07 10:40:41,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:41,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:40:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:40:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:40:41,644 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 43 states. [2018-11-07 10:40:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:41,869 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-11-07 10:40:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:40:41,869 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2018-11-07 10:40:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:41,870 INFO L225 Difference]: With dead ends: 121 [2018-11-07 10:40:41,870 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 10:40:41,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:40:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 10:40:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-07 10:40:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 10:40:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 10:40:41,876 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2018-11-07 10:40:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:41,877 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 10:40:41,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:40:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 10:40:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 10:40:41,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:41,877 INFO L375 BasicCegarLoop]: trace histogram [32, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:41,877 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:41,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1585208793, now seen corresponding path program 18 times [2018-11-07 10:40:41,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:41,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:41,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:41,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:42,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:42,438 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:42,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:42,447 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:42,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:42,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:42,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:42,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:43,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:43,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-11-07 10:40:43,538 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:43,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:40:43,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:40:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:43,540 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 30 states. [2018-11-07 10:40:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:43,705 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-11-07 10:40:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:40:43,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-07 10:40:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:43,706 INFO L225 Difference]: With dead ends: 124 [2018-11-07 10:40:43,706 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 10:40:43,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 10:40:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-07 10:40:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 10:40:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-07 10:40:43,711 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2018-11-07 10:40:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:43,711 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-07 10:40:43,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:40:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-07 10:40:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 10:40:43,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:43,712 INFO L375 BasicCegarLoop]: trace histogram [33, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:43,712 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:43,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 400065878, now seen corresponding path program 19 times [2018-11-07 10:40:43,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:43,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:44,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:44,314 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:44,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:44,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,314 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 10:40:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:44,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:44,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:45,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:45,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-11-07 10:40:45,187 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:40:45,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:40:45,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:45,188 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2018-11-07 10:40:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:45,355 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-07 10:40:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:40:45,356 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-11-07 10:40:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:45,357 INFO L225 Difference]: With dead ends: 126 [2018-11-07 10:40:45,357 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 10:40:45,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 10:40:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-07 10:40:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 10:40:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-07 10:40:45,363 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-11-07 10:40:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:45,363 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-07 10:40:45,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:40:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-07 10:40:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 10:40:45,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:45,364 INFO L375 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:45,364 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:45,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash -355941997, now seen corresponding path program 20 times [2018-11-07 10:40:45,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,366 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 567 proven. 420 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-07 10:40:45,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:45,806 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:45,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:45,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:45,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:45,815 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:45,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 10:40:45,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:45,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-07 10:40:46,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-07 10:40:46,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:46,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 17] total 62 [2018-11-07 10:40:46,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:46,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:40:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:40:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:40:46,856 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 47 states. [2018-11-07 10:40:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:47,092 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-11-07 10:40:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:40:47,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 95 [2018-11-07 10:40:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:47,095 INFO L225 Difference]: With dead ends: 131 [2018-11-07 10:40:47,095 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 10:40:47,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:40:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 10:40:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-07 10:40:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 10:40:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-07 10:40:47,100 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2018-11-07 10:40:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:47,101 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-07 10:40:47,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:40:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-07 10:40:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:40:47,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:47,102 INFO L375 BasicCegarLoop]: trace histogram [36, 21, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:47,102 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:47,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2030471190, now seen corresponding path program 21 times [2018-11-07 10:40:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:47,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:47,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:47,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:47,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:47,519 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:47,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:47,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:47,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:47,527 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:47,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:47,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:47,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:47,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:48,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:48,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-11-07 10:40:48,809 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:48,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:40:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:40:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:48,811 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 33 states. [2018-11-07 10:40:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:49,041 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-11-07 10:40:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:40:49,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2018-11-07 10:40:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:49,043 INFO L225 Difference]: With dead ends: 134 [2018-11-07 10:40:49,043 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 10:40:49,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 10:40:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-07 10:40:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:40:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-11-07 10:40:49,049 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-11-07 10:40:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:49,049 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-11-07 10:40:49,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:40:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-07 10:40:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 10:40:49,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:49,050 INFO L375 BasicCegarLoop]: trace histogram [37, 22, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:49,051 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:49,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash -156708249, now seen corresponding path program 22 times [2018-11-07 10:40:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:49,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:49,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:49,961 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:49,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:49,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:49,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:40:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:49,975 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:50,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:50,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:52,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:52,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-11-07 10:40:52,419 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:52,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:40:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:40:52,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:52,421 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2018-11-07 10:40:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:52,602 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-11-07 10:40:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:40:52,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-07 10:40:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:52,610 INFO L225 Difference]: With dead ends: 136 [2018-11-07 10:40:52,610 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 10:40:52,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 10:40:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-07 10:40:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 10:40:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-07 10:40:52,616 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2018-11-07 10:40:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:52,617 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-07 10:40:52,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:40:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-07 10:40:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 10:40:52,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:52,618 INFO L375 BasicCegarLoop]: trace histogram [38, 23, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:52,618 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:52,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash 938181028, now seen corresponding path program 23 times [2018-11-07 10:40:52,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:52,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 696 proven. 552 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-07 10:40:53,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:53,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:53,507 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:53,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:53,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:53,508 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 10:40:53,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:53,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:53,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 10:40:53,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:53,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-07 10:40:54,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-07 10:40:54,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:54,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18, 18] total 67 [2018-11-07 10:40:54,780 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:54,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:40:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:40:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:40:54,782 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 51 states. [2018-11-07 10:40:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:55,023 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-11-07 10:40:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:40:55,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 103 [2018-11-07 10:40:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:55,027 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:40:55,027 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 10:40:55,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:40:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 10:40:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-07 10:40:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 10:40:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-07 10:40:55,031 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2018-11-07 10:40:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:55,032 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-07 10:40:55,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:40:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-07 10:40:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:40:55,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:55,032 INFO L375 BasicCegarLoop]: trace histogram [40, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:55,033 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:55,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1615686331, now seen corresponding path program 24 times [2018-11-07 10:40:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:55,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:55,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:55,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:55,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:55,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:55,660 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 10:40:55,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:55,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:55,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:55,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:55,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:55,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:56,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:56,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-11-07 10:40:56,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:56,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:40:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:40:56,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:56,735 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 36 states. [2018-11-07 10:40:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:56,922 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-11-07 10:40:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 10:40:56,923 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2018-11-07 10:40:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:56,924 INFO L225 Difference]: With dead ends: 144 [2018-11-07 10:40:56,924 INFO L226 Difference]: Without dead ends: 110 [2018-11-07 10:40:56,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-07 10:40:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-07 10:40:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 10:40:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-07 10:40:56,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2018-11-07 10:40:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:56,931 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-07 10:40:56,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:40:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-07 10:40:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:40:56,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:56,932 INFO L375 BasicCegarLoop]: trace histogram [41, 25, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:56,933 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:56,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 627898424, now seen corresponding path program 25 times [2018-11-07 10:40:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:57,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:57,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:57,555 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:57,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:57,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:57,555 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 10:40:57,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:57,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:57,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:57,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-11-07 10:40:58,737 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:40:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:40:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:58,739 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 37 states. [2018-11-07 10:40:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:58,933 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-11-07 10:40:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:40:58,933 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2018-11-07 10:40:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:58,935 INFO L225 Difference]: With dead ends: 146 [2018-11-07 10:40:58,935 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 10:40:58,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 184 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 10:40:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-07 10:40:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 10:40:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-11-07 10:40:58,941 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2018-11-07 10:40:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:58,942 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-11-07 10:40:58,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:40:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-11-07 10:40:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 10:40:58,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:58,943 INFO L375 BasicCegarLoop]: trace histogram [42, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:58,943 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:58,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash 551492213, now seen corresponding path program 26 times [2018-11-07 10:40:58,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:58,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:58,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 837 proven. 702 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-07 10:40:59,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:59,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:59,607 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:59,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 10:40:59,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:59,608 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 10:40:59,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:59,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:59,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-07 10:40:59,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:59,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-07 10:41:00,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-07 10:41:00,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:00,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19, 19] total 72 [2018-11-07 10:41:00,993 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:00,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 10:41:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 10:41:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 10:41:00,994 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 55 states. [2018-11-07 10:41:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:01,316 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-11-07 10:41:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:41:01,316 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2018-11-07 10:41:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:01,318 INFO L225 Difference]: With dead ends: 151 [2018-11-07 10:41:01,318 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 10:41:01,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 10:41:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 10:41:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-07 10:41:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-07 10:41:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-11-07 10:41:01,324 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 111 [2018-11-07 10:41:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-11-07 10:41:01,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 10:41:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-11-07 10:41:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 10:41:01,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:01,325 INFO L375 BasicCegarLoop]: trace histogram [44, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:01,326 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 972817996, now seen corresponding path program 27 times [2018-11-07 10:41:01,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:01,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:01,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:02,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:02,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:02,852 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:02,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:02,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:02,852 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 10:41:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:02,861 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:02,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:02,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:02,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:02,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:04,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:04,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-11-07 10:41:04,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:04,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:41:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:41:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:04,087 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 39 states. [2018-11-07 10:41:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:04,382 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2018-11-07 10:41:04,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:41:04,383 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2018-11-07 10:41:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:04,384 INFO L225 Difference]: With dead ends: 154 [2018-11-07 10:41:04,384 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 10:41:04,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 10:41:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-07 10:41:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 10:41:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-07 10:41:04,390 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2018-11-07 10:41:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:04,390 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-07 10:41:04,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:41:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-07 10:41:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 10:41:04,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:04,391 INFO L375 BasicCegarLoop]: trace histogram [45, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:04,391 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:04,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2035759415, now seen corresponding path program 28 times [2018-11-07 10:41:04,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:04,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:04,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:05,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:05,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:05,051 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:05,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:05,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:05,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 10:41:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:05,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:05,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:05,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:06,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:06,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-11-07 10:41:06,007 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:06,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:41:06,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:41:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:06,008 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 40 states. [2018-11-07 10:41:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:06,184 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-11-07 10:41:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:41:06,185 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2018-11-07 10:41:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:06,186 INFO L225 Difference]: With dead ends: 156 [2018-11-07 10:41:06,186 INFO L226 Difference]: Without dead ends: 120 [2018-11-07 10:41:06,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 197 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-07 10:41:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-07 10:41:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 10:41:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-07 10:41:06,192 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-11-07 10:41:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:06,192 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-07 10:41:06,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:41:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-07 10:41:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:41:06,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:06,193 INFO L375 BasicCegarLoop]: trace histogram [46, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:06,193 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:06,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1529306118, now seen corresponding path program 29 times [2018-11-07 10:41:06,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:06,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 990 proven. 870 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-07 10:41:07,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:07,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:07,282 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:07,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:07,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:07,283 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 10:41:07,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:07,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:07,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 10:41:07,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:07,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-11-07 10:41:08,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-11-07 10:41:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:09,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 77 [2018-11-07 10:41:09,408 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:09,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 10:41:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 10:41:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:41:09,409 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 59 states. [2018-11-07 10:41:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:09,725 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2018-11-07 10:41:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:41:09,725 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 119 [2018-11-07 10:41:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:09,727 INFO L225 Difference]: With dead ends: 161 [2018-11-07 10:41:09,727 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 10:41:09,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:41:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 10:41:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-11-07 10:41:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-07 10:41:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-11-07 10:41:09,734 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2018-11-07 10:41:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:09,734 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-11-07 10:41:09,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 10:41:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-11-07 10:41:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 10:41:09,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:09,735 INFO L375 BasicCegarLoop]: trace histogram [48, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:09,735 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:09,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:09,736 INFO L82 PathProgramCache]: Analyzing trace with hash -892003683, now seen corresponding path program 30 times [2018-11-07 10:41:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:09,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:09,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:09,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:09,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:10,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:10,523 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:10,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:10,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:10,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:10,523 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 10:41:10,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:10,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:10,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:10,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:10,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:10,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:11,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:11,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-11-07 10:41:11,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:11,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:41:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:41:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:11,714 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 42 states. [2018-11-07 10:41:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:12,022 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-11-07 10:41:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:41:12,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 123 [2018-11-07 10:41:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:12,024 INFO L225 Difference]: With dead ends: 164 [2018-11-07 10:41:12,024 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 10:41:12,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 207 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 10:41:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 10:41:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 10:41:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-11-07 10:41:12,029 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-11-07 10:41:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:12,030 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-11-07 10:41:12,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:41:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-11-07 10:41:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 10:41:12,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:12,031 INFO L375 BasicCegarLoop]: trace histogram [49, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:12,031 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:12,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1680608794, now seen corresponding path program 31 times [2018-11-07 10:41:12,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:12,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:12,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:12,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:12,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:12,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:12,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:12,851 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 10:41:12,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:12,873 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:12,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:12,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:14,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:14,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-11-07 10:41:14,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:14,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:41:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:41:14,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:14,268 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 43 states. [2018-11-07 10:41:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:14,549 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-11-07 10:41:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:41:14,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2018-11-07 10:41:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:14,551 INFO L225 Difference]: With dead ends: 166 [2018-11-07 10:41:14,551 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 10:41:14,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 10:41:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-07 10:41:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:41:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-11-07 10:41:14,558 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2018-11-07 10:41:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:14,558 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-11-07 10:41:14,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:41:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-11-07 10:41:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 10:41:14,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:14,559 INFO L375 BasicCegarLoop]: trace histogram [50, 32, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:14,560 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:14,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash 60036695, now seen corresponding path program 32 times [2018-11-07 10:41:14,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:14,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1155 proven. 1056 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-07 10:41:15,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:15,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:15,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:15,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:15,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:15,598 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 10:41:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:15,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:15,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 10:41:15,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:15,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-11-07 10:41:16,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-11-07 10:41:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 82 [2018-11-07 10:41:17,393 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:17,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 10:41:17,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 10:41:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:41:17,395 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 63 states. [2018-11-07 10:41:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:17,756 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-11-07 10:41:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 10:41:17,756 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 127 [2018-11-07 10:41:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:17,758 INFO L225 Difference]: With dead ends: 171 [2018-11-07 10:41:17,758 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 10:41:17,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:41:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 10:41:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-07 10:41:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 10:41:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-11-07 10:41:17,762 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2018-11-07 10:41:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:17,763 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-11-07 10:41:17,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 10:41:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-11-07 10:41:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 10:41:17,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:17,763 INFO L375 BasicCegarLoop]: trace histogram [52, 33, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:17,764 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1913358418, now seen corresponding path program 33 times [2018-11-07 10:41:17,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:17,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:17,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:19,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:19,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:19,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:19,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:19,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:19,061 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 10:41:19,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:19,068 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:19,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:19,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:19,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:19,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:20,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:20,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-11-07 10:41:20,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:20,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:41:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:41:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:20,102 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2018-11-07 10:41:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:20,286 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-11-07 10:41:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 10:41:20,287 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2018-11-07 10:41:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:20,288 INFO L225 Difference]: With dead ends: 174 [2018-11-07 10:41:20,288 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 10:41:20,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 10:41:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-11-07 10:41:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-07 10:41:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-11-07 10:41:20,295 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2018-11-07 10:41:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:20,295 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-11-07 10:41:20,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:41:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-11-07 10:41:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 10:41:20,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:20,296 INFO L375 BasicCegarLoop]: trace histogram [53, 34, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:20,296 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:20,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash -871195093, now seen corresponding path program 34 times [2018-11-07 10:41:20,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:20,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:20,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:22,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:22,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:22,348 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:22,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:22,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:22,349 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 10:41:22,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:22,357 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:22,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:22,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:23,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-11-07 10:41:23,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:23,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:41:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:41:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:23,343 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 46 states. [2018-11-07 10:41:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:23,553 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-11-07 10:41:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 10:41:23,554 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2018-11-07 10:41:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:23,555 INFO L225 Difference]: With dead ends: 176 [2018-11-07 10:41:23,559 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 10:41:23,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 10:41:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-07 10:41:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-07 10:41:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-11-07 10:41:23,566 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2018-11-07 10:41:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:23,567 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-11-07 10:41:23,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:41:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-11-07 10:41:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 10:41:23,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:23,568 INFO L375 BasicCegarLoop]: trace histogram [54, 35, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:23,568 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:23,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash -79619736, now seen corresponding path program 35 times [2018-11-07 10:41:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:23,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-07 10:41:24,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:24,863 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:24,863 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:24,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:24,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:24,863 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 10:41:24,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:24,873 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:24,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-07 10:41:24,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:24,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-07 10:41:25,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-07 10:41:26,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:26,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22, 22] total 87 [2018-11-07 10:41:26,817 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:26,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 10:41:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 10:41:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:41:26,819 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 67 states. [2018-11-07 10:41:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:27,239 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-11-07 10:41:27,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 10:41:27,239 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 135 [2018-11-07 10:41:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:27,241 INFO L225 Difference]: With dead ends: 181 [2018-11-07 10:41:27,241 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 10:41:27,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:41:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 10:41:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-07 10:41:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 10:41:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 10:41:27,248 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2018-11-07 10:41:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:27,249 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 10:41:27,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 10:41:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 10:41:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 10:41:27,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:27,250 INFO L375 BasicCegarLoop]: trace histogram [56, 36, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:27,250 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:27,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash -540938881, now seen corresponding path program 36 times [2018-11-07 10:41:27,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:27,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:27,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:28,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:28,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:28,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:28,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:28,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:28,459 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 10:41:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:28,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:28,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:28,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:28,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:28,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:29,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-11-07 10:41:29,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:29,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:41:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:41:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:29,887 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 48 states. [2018-11-07 10:41:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:30,110 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2018-11-07 10:41:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:41:30,111 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-07 10:41:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:30,112 INFO L225 Difference]: With dead ends: 184 [2018-11-07 10:41:30,113 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 10:41:30,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 10:41:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-07 10:41:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-07 10:41:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-11-07 10:41:30,118 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2018-11-07 10:41:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:30,119 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-11-07 10:41:30,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:41:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-11-07 10:41:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 10:41:30,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:30,120 INFO L375 BasicCegarLoop]: trace histogram [57, 37, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:30,120 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:30,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1379645700, now seen corresponding path program 37 times [2018-11-07 10:41:30,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:30,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:30,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:31,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:31,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:31,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:31,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:31,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:31,320 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 10:41:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:31,329 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:31,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:31,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:33,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:33,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-11-07 10:41:33,350 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:33,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:41:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:41:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:33,351 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 49 states. [2018-11-07 10:41:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:33,589 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-11-07 10:41:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:41:33,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2018-11-07 10:41:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:33,591 INFO L225 Difference]: With dead ends: 186 [2018-11-07 10:41:33,591 INFO L226 Difference]: Without dead ends: 144 [2018-11-07 10:41:33,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 236 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-07 10:41:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-07 10:41:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 10:41:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-11-07 10:41:33,597 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-11-07 10:41:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:33,598 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-11-07 10:41:33,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:41:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-11-07 10:41:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 10:41:33,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:33,599 INFO L375 BasicCegarLoop]: trace histogram [58, 38, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:33,599 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:33,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 76952889, now seen corresponding path program 38 times [2018-11-07 10:41:33,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:33,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:33,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1521 proven. 1482 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-07 10:41:34,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:34,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:34,855 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:34,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:34,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:34,856 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 10:41:34,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:34,868 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:34,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 10:41:34,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:34,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-07 10:41:35,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-07 10:41:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:37,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 92 [2018-11-07 10:41:37,012 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 10:41:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 10:41:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:41:37,013 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 71 states. [2018-11-07 10:41:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:37,365 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2018-11-07 10:41:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 10:41:37,365 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2018-11-07 10:41:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:37,366 INFO L225 Difference]: With dead ends: 191 [2018-11-07 10:41:37,367 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 10:41:37,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:41:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 10:41:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-11-07 10:41:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-07 10:41:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-11-07 10:41:37,373 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2018-11-07 10:41:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:37,373 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-11-07 10:41:37,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 10:41:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-11-07 10:41:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 10:41:37,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:37,375 INFO L375 BasicCegarLoop]: trace histogram [60, 39, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:37,375 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:37,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash -621720560, now seen corresponding path program 39 times [2018-11-07 10:41:37,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:37,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:37,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:38,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:38,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:38,436 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:38,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:38,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:38,436 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 10:41:38,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:38,445 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:38,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:38,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:38,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:38,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:39,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-11-07 10:41:39,743 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:39,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:41:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:41:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:39,744 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 51 states. [2018-11-07 10:41:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:39,952 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-11-07 10:41:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:41:39,953 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2018-11-07 10:41:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:39,954 INFO L225 Difference]: With dead ends: 194 [2018-11-07 10:41:39,954 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 10:41:39,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 10:41:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-07 10:41:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 10:41:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-11-07 10:41:39,959 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-11-07 10:41:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:39,960 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-11-07 10:41:39,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:41:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-11-07 10:41:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 10:41:39,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:39,960 INFO L375 BasicCegarLoop]: trace histogram [61, 40, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:39,961 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:39,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1225467763, now seen corresponding path program 40 times [2018-11-07 10:41:39,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:39,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:39,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:41,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:41,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:41,082 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:41,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:41,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:41,082 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 10:41:41,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:41,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:41,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:41,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-07 10:41:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:42,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-11-07 10:41:42,110 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:42,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 10:41:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 10:41:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:42,110 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 52 states. [2018-11-07 10:41:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:42,385 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2018-11-07 10:41:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 10:41:42,385 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 149 [2018-11-07 10:41:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:42,387 INFO L225 Difference]: With dead ends: 196 [2018-11-07 10:41:42,387 INFO L226 Difference]: Without dead ends: 152 [2018-11-07 10:41:42,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-07 10:41:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-07 10:41:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-07 10:41:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-11-07 10:41:42,393 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2018-11-07 10:41:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:42,393 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-11-07 10:41:42,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 10:41:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-11-07 10:41:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 10:41:42,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:42,394 INFO L375 BasicCegarLoop]: trace histogram [62, 41, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:42,394 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:42,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 41 times [2018-11-07 10:41:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:42,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1833 proven. 529 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:41:43,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:43,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:43,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:43,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:43,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:43,004 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 10:41:43,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:43,016 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:43,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-07 10:41:43,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:43,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:41:43,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:41:43,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 48 [2018-11-07 10:41:43,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:41:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:41:43,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:41:43,755 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 26 states. [2018-11-07 10:41:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:43,859 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-11-07 10:41:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:41:43,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 151 [2018-11-07 10:41:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:43,861 INFO L225 Difference]: With dead ends: 162 [2018-11-07 10:41:43,862 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 10:41:43,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:41:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 10:41:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-07 10:41:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-07 10:41:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-11-07 10:41:43,870 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2018-11-07 10:41:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:43,870 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-11-07 10:41:43,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:41:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-11-07 10:41:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 10:41:43,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:43,872 INFO L375 BasicCegarLoop]: trace histogram [65, 41, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:43,872 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:43,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:43,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 42 times [2018-11-07 10:41:43,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:43,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:43,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2067 proven. 676 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:41:44,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:44,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:44,636 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:44,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:44,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:44,636 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 10:41:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:44,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:44,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:44,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:44,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:45,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 77, 77] total 102 [2018-11-07 10:41:47,863 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:47,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-07 10:41:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-07 10:41:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:47,865 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-11-07 10:41:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:48,245 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2018-11-07 10:41:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-07 10:41:48,245 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-11-07 10:41:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:48,246 INFO L225 Difference]: With dead ends: 168 [2018-11-07 10:41:48,247 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 10:41:48,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 190 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 10:41:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-11-07 10:41:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-07 10:41:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-11-07 10:41:48,252 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 157 [2018-11-07 10:41:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:48,253 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-11-07 10:41:48,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-07 10:41:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-11-07 10:41:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 10:41:48,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:48,254 INFO L375 BasicCegarLoop]: trace histogram [68, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:48,254 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:48,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 43 times [2018-11-07 10:41:48,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:48,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:48,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2301 proven. 841 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:41:49,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:49,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:49,654 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:49,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:49,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:49,655 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 10:41:49,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:49,666 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:49,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:50,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:52,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:52,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 80, 80] total 102 [2018-11-07 10:41:52,848 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:52,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-07 10:41:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-07 10:41:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:52,850 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 82 states. [2018-11-07 10:41:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:53,329 INFO L93 Difference]: Finished difference Result 174 states and 177 transitions. [2018-11-07 10:41:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-07 10:41:53,330 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 163 [2018-11-07 10:41:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:53,331 INFO L225 Difference]: With dead ends: 174 [2018-11-07 10:41:53,331 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 10:41:53,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 199 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12007 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 10:41:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-11-07 10:41:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-07 10:41:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-11-07 10:41:53,338 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 163 [2018-11-07 10:41:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:53,338 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-11-07 10:41:53,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-07 10:41:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-11-07 10:41:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 10:41:53,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:53,339 INFO L375 BasicCegarLoop]: trace histogram [71, 41, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:53,339 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:53,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 44 times [2018-11-07 10:41:53,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:53,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:53,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2535 proven. 1024 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:41:54,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:54,152 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:54,152 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:54,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:54,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:54,152 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 10:41:54,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:54,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:54,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-11-07 10:41:54,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:54,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:41:54,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:41:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 52 [2018-11-07 10:41:55,297 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:55,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:41:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:41:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:55,298 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 35 states. [2018-11-07 10:41:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:55,455 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2018-11-07 10:41:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:41:55,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 169 [2018-11-07 10:41:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:55,457 INFO L225 Difference]: With dead ends: 180 [2018-11-07 10:41:55,458 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 10:41:55,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 308 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 10:41:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-11-07 10:41:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-07 10:41:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-11-07 10:41:55,462 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 169 [2018-11-07 10:41:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:55,463 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-11-07 10:41:55,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:41:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-11-07 10:41:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 10:41:55,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:55,464 INFO L375 BasicCegarLoop]: trace histogram [74, 41, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:55,464 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 45 times [2018-11-07 10:41:55,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:55,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:55,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1225 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:41:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:56,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:56,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:56,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 10:41:56,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:56,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 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 10:41:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:56,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:56,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:56,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:56,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:57,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:59,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 86, 86] total 102 [2018-11-07 10:41:59,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:59,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-11-07 10:41:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-11-07 10:41:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:59,122 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 88 states. [2018-11-07 10:41:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:59,701 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-11-07 10:41:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-11-07 10:41:59,701 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 175 [2018-11-07 10:41:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:59,702 INFO L225 Difference]: With dead ends: 186 [2018-11-07 10:41:59,702 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 10:41:59,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 217 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:41:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 10:41:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-07 10:41:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-07 10:41:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-11-07 10:41:59,708 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 175 [2018-11-07 10:41:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:59,708 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-11-07 10:41:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-11-07 10:41:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-11-07 10:41:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 10:41:59,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:59,710 INFO L375 BasicCegarLoop]: trace histogram [77, 41, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:59,710 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:59,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 46 times [2018-11-07 10:41:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:59,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:59,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 1444 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:42:00,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:00,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:00,429 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:00,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:00,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:00,430 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 10:42:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:00,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:00,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:01,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 89, 89] total 102 [2018-11-07 10:42:03,531 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:03,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-07 10:42:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-07 10:42:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:03,533 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 91 states. [2018-11-07 10:42:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:04,063 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-11-07 10:42:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-07 10:42:04,063 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 181 [2018-11-07 10:42:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:04,064 INFO L225 Difference]: With dead ends: 192 [2018-11-07 10:42:04,064 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 10:42:04,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 226 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14212 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 10:42:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-11-07 10:42:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 10:42:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-11-07 10:42:04,071 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 181 [2018-11-07 10:42:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:04,072 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-11-07 10:42:04,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-07 10:42:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-11-07 10:42:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 10:42:04,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:04,073 INFO L375 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:04,073 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:04,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 47 times [2018-11-07 10:42:04,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:04,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:04,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3237 proven. 1681 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:42:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:05,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:05,132 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:05,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:05,132 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 10:42:05,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:05,141 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:05,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2018-11-07 10:42:05,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:05,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:42:05,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:42:06,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:06,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 42, 42] total 52 [2018-11-07 10:42:06,238 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:06,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:42:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:42:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:42:06,239 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 44 states. [2018-11-07 10:42:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:06,415 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-11-07 10:42:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:42:06,416 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 187 [2018-11-07 10:42:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:06,418 INFO L225 Difference]: With dead ends: 198 [2018-11-07 10:42:06,418 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 10:42:06,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 335 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:42:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 10:42:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-11-07 10:42:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 10:42:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-11-07 10:42:06,426 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 187 [2018-11-07 10:42:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:06,426 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-11-07 10:42:06,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:42:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-11-07 10:42:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 10:42:06,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:06,427 INFO L375 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:06,428 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:06,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:06,428 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 48 times [2018-11-07 10:42:06,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:06,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:06,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1936 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:42:07,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:07,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:07,422 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:07,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:07,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:07,423 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 10:42:07,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:07,432 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:07,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:07,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:07,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:08,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:10,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:10,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 95, 95] total 102 [2018-11-07 10:42:10,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:10,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 10:42:10,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 10:42:10,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:10,841 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 97 states. [2018-11-07 10:42:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:11,381 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-11-07 10:42:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-07 10:42:11,381 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 193 [2018-11-07 10:42:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:11,382 INFO L225 Difference]: With dead ends: 204 [2018-11-07 10:42:11,382 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 10:42:11,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 244 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 10:42:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-11-07 10:42:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 10:42:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-07 10:42:11,390 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 193 [2018-11-07 10:42:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-07 10:42:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 10:42:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-07 10:42:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 10:42:11,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:11,392 INFO L375 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:11,392 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 49 times [2018-11-07 10:42:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:11,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:11,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3705 proven. 2209 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-07 10:42:12,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:12,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:12,382 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:12,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:12,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:12,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:12,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:12,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:12,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:13,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:16,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 98, 98] total 102 [2018-11-07 10:42:16,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-11-07 10:42:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-11-07 10:42:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:16,132 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 100 states. [2018-11-07 10:42:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:16,740 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-11-07 10:42:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-07 10:42:16,740 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 199 [2018-11-07 10:42:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:16,742 INFO L225 Difference]: With dead ends: 210 [2018-11-07 10:42:16,742 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 10:42:16,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 253 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16417 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 10:42:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-11-07 10:42:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-07 10:42:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-11-07 10:42:16,747 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 199 [2018-11-07 10:42:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:16,747 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-11-07 10:42:16,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-11-07 10:42:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-11-07 10:42:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-07 10:42:16,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:16,749 INFO L375 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:16,749 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:16,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 50 times [2018-11-07 10:42:16,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:16,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:16,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:16,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3977 proven. 2304 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:42:17,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:17,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:17,819 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:17,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:17,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:17,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:17,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:17,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:17,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-11-07 10:42:17,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:17,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:18,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 101, 101] total 102 [2018-11-07 10:42:21,328 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:21,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-11-07 10:42:21,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-07 10:42:21,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:21,329 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2018-11-07 10:42:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:21,940 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-11-07 10:42:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-07 10:42:21,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2018-11-07 10:42:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:21,941 INFO L225 Difference]: With dead ends: 212 [2018-11-07 10:42:21,941 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 10:42:21,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 10:42:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-11-07 10:42:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-07 10:42:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-11-07 10:42:21,946 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2018-11-07 10:42:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-11-07 10:42:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-11-07 10:42:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-11-07 10:42:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 10:42:21,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:21,948 INFO L375 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:21,948 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:21,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 51 times [2018-11-07 10:42:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:21,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:21,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4059 proven. 2401 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-07 10:42:22,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:22,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:22,969 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:22,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:22,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:22,970 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:22,978 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:23,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:23,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:23,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:24,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:27,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:27,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 102, 102] total 102 [2018-11-07 10:42:27,100 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:27,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-07 10:42:27,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-07 10:42:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:27,102 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2018-11-07 10:42:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:27,660 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-11-07 10:42:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-07 10:42:27,661 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2018-11-07 10:42:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:27,662 INFO L225 Difference]: With dead ends: 213 [2018-11-07 10:42:27,662 INFO L226 Difference]: Without dead ends: 210 [2018-11-07 10:42:27,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 265 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-07 10:42:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-07 10:42:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 10:42:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-11-07 10:42:27,669 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2018-11-07 10:42:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:27,669 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-11-07 10:42:27,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-07 10:42:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-11-07 10:42:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 10:42:27,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:27,671 INFO L375 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:27,671 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:27,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:27,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 52 times [2018-11-07 10:42:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:27,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:27,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-07 10:42:29,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:29,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:29,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:29,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:29,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:29,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:29,545 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:29,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-07 10:42:29,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-07 10:42:30,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:30,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2018-11-07 10:42:30,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:30,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:42:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:42:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:42:30,134 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 54 states. [2018-11-07 10:42:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:32,349 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-11-07 10:42:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:42:32,349 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 209 [2018-11-07 10:42:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:32,351 INFO L225 Difference]: With dead ends: 216 [2018-11-07 10:42:32,351 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 10:42:32,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:42:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 10:42:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-11-07 10:42:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-07 10:42:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-11-07 10:42:32,361 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2018-11-07 10:42:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:32,361 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-11-07 10:42:32,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:42:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-11-07 10:42:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 10:42:32,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:32,363 INFO L375 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:32,363 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:32,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 53 times [2018-11-07 10:42:32,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:32,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:32,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:32,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-07 10:42:33,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:33,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-07 10:42:33,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:33,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 10:42:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 10:42:33,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:42:33,885 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2018-11-07 10:42:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:34,291 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-11-07 10:42:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 10:42:34,291 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2018-11-07 10:42:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:34,292 INFO L225 Difference]: With dead ends: 212 [2018-11-07 10:42:34,292 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:42:34,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:42:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:42:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:42:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:42:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:42:34,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-11-07 10:42:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:34,294 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:42:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 10:42:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:42:34,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:42:34,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:42:34,440 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 307 [2018-11-07 10:42:34,660 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 10:42:34,877 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 10:42:35,035 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 10:42:36,554 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2018-11-07 10:42:36,625 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:42:36,625 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:42:36,625 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:42:36,625 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:42:36,625 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:42:36,625 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:42:36,626 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:42:36,626 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2018-11-07 10:42:36,626 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2018-11-07 10:42:36,626 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2018-11-07 10:42:36,626 INFO L421 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2018-11-07 10:42:36,626 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2018-11-07 10:42:36,628 INFO L421 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2018-11-07 10:42:36,629 INFO L421 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2018-11-07 10:42:36,629 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L421 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L421 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L421 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2018-11-07 10:42:36,630 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L421 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2018-11-07 10:42:36,630 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2018-11-07 10:42:36,630 INFO L421 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2018-11-07 10:42:36,631 INFO L421 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2018-11-07 10:42:36,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:42:36 BoogieIcfgContainer [2018-11-07 10:42:36,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:42:36,658 INFO L168 Benchmark]: Toolchain (without parser) took 144049.06 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -352.8 MB). Peak memory consumption was 702.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:42:36,660 INFO L168 Benchmark]: CDTParser took 0.19 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 10:42:36,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.53 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 10:42:36,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.82 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 10:42:36,661 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:42:36,661 INFO L168 Benchmark]: RCFGBuilder took 620.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 10:42:36,662 INFO L168 Benchmark]: TraceAbstraction took 143058.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 317.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 423.9 MB). Peak memory consumption was 741.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:42:36,671 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.19 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 325.53 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 18.82 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 21.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 620.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143058.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 317.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 423.9 MB). Peak memory consumption was 741.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 142.9s OverallTime, 60 OverallIterations, 92 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 725 SDtfs, 2076 SDslu, 12241 SDs, 0 SdLazy, 14640 SolverSat, 1886 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14019 GetRequests, 9814 SyntacticMatches, 1134 SemanticMatches, 3071 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129326 ImplicationChecksByTransitivity, 110.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 60 MinimizatonAttempts, 21 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 115.0s InterpolantComputationTime, 12570 NumberOfCodeBlocks, 12334 NumberOfCodeBlocksAsserted, 754 NumberOfCheckSat, 18490 ConstructedInterpolants, 0 QuantifiedInterpolants, 6182396 SizeOfPredicates, 37 NumberOfNonLiveVariables, 14570 ConjunctsInSsa, 2026 ConjunctsInUnsatCore, 164 InterpolantComputations, 8 PerfectInterpolantSequences, 204938/407627 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...