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-acceleration/array_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:29:26,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:29:26,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:29:26,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:29:26,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:29:26,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:29:26,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:29:26,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:29:26,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:29:26,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:29:26,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:29:26,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:29:26,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:29:26,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:29:26,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:29:26,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:29:26,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:29:26,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:29:26,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:29:26,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:29:26,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:29:26,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:29:26,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:29:26,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:29:26,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:29:26,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:29:26,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:29:26,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:29:26,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:29:26,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:29:26,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:29:26,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:29:26,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:29:26,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:29:26,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:29:26,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:29:26,284 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:29:26,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:29:26,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:29:26,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:29:26,300 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:29:26,300 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:29:26,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:29:26,301 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:29:26,301 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:29:26,301 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:29:26,301 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:29:26,301 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:29:26,302 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:29:26,302 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:29:26,302 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:29:26,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:29:26,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:29:26,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:29:26,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:29:26,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:29:26,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:29:26,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:29:26,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:29:26,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:29:26,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:29:26,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:29:26,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:29:26,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:29:26,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:29:26,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:29:26,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:29:26,306 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:29:26,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:29:26,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:29:26,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:29:26,307 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:29:26,307 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:29:26,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:29:26,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:29:26,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:29:26,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:29:26,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:29:26,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-07 10:29:26,434 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d58485b8/087e8e0481b64a48a505ceaa6cc2727d/FLAG3e245fa34 [2018-11-07 10:29:26,860 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:29:26,860 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-07 10:29:26,867 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d58485b8/087e8e0481b64a48a505ceaa6cc2727d/FLAG3e245fa34 [2018-11-07 10:29:26,884 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d58485b8/087e8e0481b64a48a505ceaa6cc2727d [2018-11-07 10:29:26,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:29:26,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:29:26,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:26,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:29:26,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:29:26,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:26" (1/1) ... [2018-11-07 10:29:26,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:26, skipping insertion in model container [2018-11-07 10:29:26,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:26" (1/1) ... [2018-11-07 10:29:26,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:29:26,942 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:29:27,137 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:27,142 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:29:27,163 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:27,186 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:29:27,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27 WrapperNode [2018-11-07 10:29:27,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:27,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:27,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:29:27,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:29:27,198 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:29:27" (1/1) ... [2018-11-07 10:29:27,206 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:29:27" (1/1) ... [2018-11-07 10:29:27,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:27,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:29:27,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:29:27,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:29:27,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (1/1) ... [2018-11-07 10:29:27,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:29:27,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:29:27,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:29:27,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:29:27,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (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:29:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:29:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:29:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:29:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:29:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:29:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:29:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:29:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:29:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:29:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:29:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:29:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:29:27,873 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:29:27,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:27 BoogieIcfgContainer [2018-11-07 10:29:27,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:29:27,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:29:27,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:29:27,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:29:27,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:29:26" (1/3) ... [2018-11-07 10:29:27,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d35e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:27, skipping insertion in model container [2018-11-07 10:29:27,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:27" (2/3) ... [2018-11-07 10:29:27,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d35e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:27, skipping insertion in model container [2018-11-07 10:29:27,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:27" (3/3) ... [2018-11-07 10:29:27,884 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call2_true-termination.i [2018-11-07 10:29:27,895 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:29:27,905 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:29:27,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:29:27,975 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:29:27,975 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:29:27,975 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:29:27,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:29:27,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:29:27,976 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:29:27,976 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:29:27,976 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:29:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 10:29:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:29:28,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:28,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:28,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1453247475, now seen corresponding path program 1 times [2018-11-07 10:29:28,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:28,218 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:29:28,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:28,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:29:28,221 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:28,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:29:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:29:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:28,242 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-07 10:29:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:28,265 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-07 10:29:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:29:28,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-07 10:29:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:28,276 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:29:28,277 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 10:29:28,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 10:29:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-07 10:29:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:29:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-07 10:29:28,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-11-07 10:29:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:28,322 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-07 10:29:28,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:29:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-07 10:29:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:29:28,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:28,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:28,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:28,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1440079151, now seen corresponding path program 1 times [2018-11-07 10:29:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:28,396 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:29:28,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:28,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:29:28,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:28,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:29:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:29:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:28,399 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-07 10:29:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:28,463 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-07 10:29:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:29:28,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-07 10:29:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:28,467 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:29:28,467 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 10:29:28,469 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:29:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 10:29:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-07 10:29:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 10:29:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-07 10:29:28,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2018-11-07 10:29:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:28,479 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-07 10:29:28,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:29:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-07 10:29:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:29:28,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:28,482 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:28,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:28,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1634508201, now seen corresponding path program 1 times [2018-11-07 10:29:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:28,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:28,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:28,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:28,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:28,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 10:29:28,608 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [19], [21], [25], [26], [34], [37], [39], [45], [46], [47], [49] [2018-11-07 10:29:28,648 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:29:28,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:29:28,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:29:28,863 INFO L272 AbstractInterpreter]: Visited 21 different actions 35 times. Merged at 6 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-07 10:29:28,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:28,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:29:28,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:28,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:28,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:28,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:29,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 10:29:29,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:29,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:29:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:29:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:29:29,139 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-11-07 10:29:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:29,242 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-07 10:29:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:29:29,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 10:29:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:29,245 INFO L225 Difference]: With dead ends: 40 [2018-11-07 10:29:29,245 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:29:29,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:29:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:29:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-07 10:29:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 10:29:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-07 10:29:29,252 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 22 [2018-11-07 10:29:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:29,252 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-07 10:29:29,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:29:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-07 10:29:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 10:29:29,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:29,254 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:29,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2041419393, now seen corresponding path program 2 times [2018-11-07 10:29:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:29,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:29,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:29,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:29,505 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:29,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:29,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:29,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:29,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:29,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:29:29,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:29,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:29,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 10:29:29,719 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:29,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:29:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:29:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:29:29,721 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 6 states. [2018-11-07 10:29:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:29,788 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-07 10:29:29,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:29:29,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-07 10:29:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:29,791 INFO L225 Difference]: With dead ends: 46 [2018-11-07 10:29:29,791 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:29:29,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:29:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:29:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-07 10:29:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:29:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-07 10:29:29,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2018-11-07 10:29:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:29,798 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-07 10:29:29,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:29:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-07 10:29:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 10:29:29,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:29,800 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:29,800 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:29,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:29,801 INFO L82 PathProgramCache]: Analyzing trace with hash -227970393, now seen corresponding path program 3 times [2018-11-07 10:29:29,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:29,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:29,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:29,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:29,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:29,989 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:29,989 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:29:29,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:29,989 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:29:30,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:30,009 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:30,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:30,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:30,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-07 10:29:30,220 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:29:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:29:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:29:30,222 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 7 states. [2018-11-07 10:29:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:30,346 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-07 10:29:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:29:30,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-07 10:29:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:30,348 INFO L225 Difference]: With dead ends: 52 [2018-11-07 10:29:30,348 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 10:29:30,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:29:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 10:29:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-07 10:29:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 10:29:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-07 10:29:30,355 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-11-07 10:29:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:30,356 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-07 10:29:30,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:29:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-07 10:29:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 10:29:30,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:30,358 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:30,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:30,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash 223280591, now seen corresponding path program 4 times [2018-11-07 10:29:30,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:30,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:30,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:30,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:29:30,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:30,669 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:29:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:30,688 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:30,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 10:29:30,940 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:30,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:29:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:29:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:29:30,942 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 8 states. [2018-11-07 10:29:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:31,032 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-07 10:29:31,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:29:31,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-07 10:29:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:31,034 INFO L225 Difference]: With dead ends: 58 [2018-11-07 10:29:31,034 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 10:29:31,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:29:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 10:29:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-07 10:29:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 10:29:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-07 10:29:31,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 40 [2018-11-07 10:29:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:31,041 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-07 10:29:31,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:29:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-07 10:29:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 10:29:31,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:31,043 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:31,043 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:31,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:31,044 INFO L82 PathProgramCache]: Analyzing trace with hash -291927305, now seen corresponding path program 5 times [2018-11-07 10:29:31,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:31,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:31,185 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:29:31,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,186 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:29:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:31,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:31,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:29:31,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:31,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:31,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 10:29:31,503 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:31,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:29:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:29:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:29:31,505 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2018-11-07 10:29:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:31,616 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-07 10:29:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:29:31,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-07 10:29:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:31,618 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:29:31,618 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 10:29:31,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:29:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 10:29:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-07 10:29:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 10:29:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-07 10:29:31,626 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 46 [2018-11-07 10:29:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:31,626 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-07 10:29:31,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:29:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-07 10:29:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 10:29:31,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:31,628 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:31,628 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:31,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1124047391, now seen corresponding path program 6 times [2018-11-07 10:29:31,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:31,941 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:31,941 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:29:31,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,941 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:29:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:31,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:32,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:32,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:32,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:32,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:32,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 10:29:32,552 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:32,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:29:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:29:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:29:32,554 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 10 states. [2018-11-07 10:29:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:32,746 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-07 10:29:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:29:32,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-07 10:29:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:32,747 INFO L225 Difference]: With dead ends: 70 [2018-11-07 10:29:32,747 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 10:29:32,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:29:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 10:29:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-11-07 10:29:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 10:29:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-07 10:29:32,755 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 52 [2018-11-07 10:29:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:32,756 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-07 10:29:32,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:29:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-07 10:29:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 10:29:32,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:32,757 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:32,758 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:32,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash -195581113, now seen corresponding path program 7 times [2018-11-07 10:29:32,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:32,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:32,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:32,888 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:29:32,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,888 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:29:32,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:32,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:32,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:32,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:33,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:33,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 10:29:33,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:33,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:29:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:29:33,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:29:33,207 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-11-07 10:29:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:33,293 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-07 10:29:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:29:33,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-07 10:29:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:33,295 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:29:33,296 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:29:33,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:29:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:29:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-07 10:29:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 10:29:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-07 10:29:33,303 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 58 [2018-11-07 10:29:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:33,303 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-07 10:29:33,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:29:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-07 10:29:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 10:29:33,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:33,305 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:33,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:33,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash -778551697, now seen corresponding path program 8 times [2018-11-07 10:29:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:33,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:33,458 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:33,458 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:29:33,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,458 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:29:33,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:33,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:33,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:29:33,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:33,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:33,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:33,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:33,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 10:29:33,793 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:33,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:29:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:29:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:29:33,794 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 12 states. [2018-11-07 10:29:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:33,922 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-07 10:29:33,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:29:33,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-11-07 10:29:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:33,923 INFO L225 Difference]: With dead ends: 82 [2018-11-07 10:29:33,923 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 10:29:33,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:29:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 10:29:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-11-07 10:29:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 10:29:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-07 10:29:33,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 64 [2018-11-07 10:29:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:33,932 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-07 10:29:33,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:29:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-07 10:29:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 10:29:33,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:33,933 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:33,934 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:33,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash 920114071, now seen corresponding path program 9 times [2018-11-07 10:29:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:34,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:34,094 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:34,094 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:29:34,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,094 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:29:34,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:34,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:34,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:34,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:34,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:34,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:34,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-07 10:29:34,479 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:34,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:29:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:29:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 10:29:34,480 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 13 states. [2018-11-07 10:29:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:34,596 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-07 10:29:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:29:34,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-11-07 10:29:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:34,599 INFO L225 Difference]: With dead ends: 88 [2018-11-07 10:29:34,599 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 10:29:34,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 10:29:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 10:29:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-07 10:29:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 10:29:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-07 10:29:34,607 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 70 [2018-11-07 10:29:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-07 10:29:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:29:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-07 10:29:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-07 10:29:34,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:34,610 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:34,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:34,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1253250369, now seen corresponding path program 10 times [2018-11-07 10:29:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:34,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:34,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:34,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:34,794 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:34,794 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:29:34,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,794 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:29:34,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:34,823 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:34,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:34,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:35,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:35,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 10:29:35,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:35,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:29:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:29:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:29:35,305 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 14 states. [2018-11-07 10:29:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:35,414 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-07 10:29:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:29:35,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2018-11-07 10:29:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:35,417 INFO L225 Difference]: With dead ends: 94 [2018-11-07 10:29:35,417 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 10:29:35,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:29:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 10:29:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-07 10:29:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 10:29:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-07 10:29:35,423 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 76 [2018-11-07 10:29:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:35,423 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-07 10:29:35,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:29:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-07 10:29:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-07 10:29:35,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:35,425 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:35,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:35,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1152515097, now seen corresponding path program 11 times [2018-11-07 10:29:35,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:35,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:35,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:35,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:35,869 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:35,869 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:29:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:35,869 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:29:35,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:35,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:36,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:29:36,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:36,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:36,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:36,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:36,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 10:29:36,753 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:36,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:29:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:29:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:29:36,754 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 15 states. [2018-11-07 10:29:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:36,850 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-07 10:29:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:29:36,851 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-11-07 10:29:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:36,852 INFO L225 Difference]: With dead ends: 100 [2018-11-07 10:29:36,852 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 10:29:36,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:29:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 10:29:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-11-07 10:29:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:29:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-07 10:29:36,859 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 82 [2018-11-07 10:29:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:36,860 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-07 10:29:36,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:29:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-07 10:29:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-07 10:29:36,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:36,861 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:36,862 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:36,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:36,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1011982095, now seen corresponding path program 12 times [2018-11-07 10:29:36,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:36,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:36,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:37,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:37,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:37,061 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:29:37,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,062 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:29:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:37,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:37,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:37,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:37,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:37,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:37,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:37,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-07 10:29:37,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:37,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:29:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:29:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:29:37,706 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 16 states. [2018-11-07 10:29:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:37,881 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-07 10:29:37,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:29:37,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-11-07 10:29:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:37,883 INFO L225 Difference]: With dead ends: 106 [2018-11-07 10:29:37,883 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 10:29:37,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:29:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 10:29:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-07 10:29:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 10:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-07 10:29:37,889 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 88 [2018-11-07 10:29:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:37,890 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-07 10:29:37,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:29:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-07 10:29:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 10:29:37,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:37,893 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:37,893 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:37,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1492007991, now seen corresponding path program 13 times [2018-11-07 10:29:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:37,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:37,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:38,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:38,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:38,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:38,192 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:29:38,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:38,192 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:29:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:38,201 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:38,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:38,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 10:29:38,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:29:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:29:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:29:38,914 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 17 states. [2018-11-07 10:29:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:39,012 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-11-07 10:29:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:29:39,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2018-11-07 10:29:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:39,014 INFO L225 Difference]: With dead ends: 112 [2018-11-07 10:29:39,014 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 10:29:39,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:29:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 10:29:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-11-07 10:29:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 10:29:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-07 10:29:39,020 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 94 [2018-11-07 10:29:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:39,020 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-07 10:29:39,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:29:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-07 10:29:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-07 10:29:39,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:39,022 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:39,022 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:39,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 114973535, now seen corresponding path program 14 times [2018-11-07 10:29:39,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:39,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:39,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:39,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:39,283 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:39,283 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:39,283 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:29:39,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:39,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 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:29:39,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:39,292 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:39,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 10:29:39,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:39,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:39,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:39,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:39,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 10:29:39,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:39,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:29:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:29:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:29:39,841 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 18 states. [2018-11-07 10:29:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:39,980 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-11-07 10:29:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:29:39,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 100 [2018-11-07 10:29:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:39,982 INFO L225 Difference]: With dead ends: 118 [2018-11-07 10:29:39,982 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 10:29:39,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:29:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 10:29:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-11-07 10:29:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 10:29:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-07 10:29:39,987 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 100 [2018-11-07 10:29:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:39,988 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-07 10:29:39,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:29:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-07 10:29:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 10:29:39,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:39,990 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:39,990 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:39,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1192461177, now seen corresponding path program 15 times [2018-11-07 10:29:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:39,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:39,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:40,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:40,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:40,329 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:29:40,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:40,329 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:29:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:40,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:40,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:40,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:40,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:40,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:41,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:41,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-07 10:29:41,446 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:29:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:29:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:29:41,447 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 19 states. [2018-11-07 10:29:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:41,555 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-11-07 10:29:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:29:41,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-11-07 10:29:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:41,557 INFO L225 Difference]: With dead ends: 124 [2018-11-07 10:29:41,557 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 10:29:41,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:29:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 10:29:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-11-07 10:29:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 10:29:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-11-07 10:29:41,563 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 106 [2018-11-07 10:29:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-11-07 10:29:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:29:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-11-07 10:29:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 10:29:41,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:41,565 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:41,565 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:41,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash 119218095, now seen corresponding path program 16 times [2018-11-07 10:29:41,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:41,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:41,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:41,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:41,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:42,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:42,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:42,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:42,956 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:29:42,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:42,957 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:29:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:42,965 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:43,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:43,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:43,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:43,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 10:29:43,970 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:43,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:29:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:29:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:43,971 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 20 states. [2018-11-07 10:29:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:44,125 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-11-07 10:29:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:29:44,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2018-11-07 10:29:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:44,128 INFO L225 Difference]: With dead ends: 130 [2018-11-07 10:29:44,128 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 10:29:44,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 10:29:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-11-07 10:29:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 10:29:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-07 10:29:44,132 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 112 [2018-11-07 10:29:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:44,133 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-07 10:29:44,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:29:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-07 10:29:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 10:29:44,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:44,134 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:44,134 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:44,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1451017431, now seen corresponding path program 17 times [2018-11-07 10:29:44,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:44,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:44,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:44,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:44,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:44,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:44,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:44,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:44,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:44,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:44,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 10:29:44,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:44,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:44,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:45,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:45,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 10:29:45,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:45,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:29:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:29:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:29:45,222 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 21 states. [2018-11-07 10:29:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:45,345 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-11-07 10:29:45,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:29:45,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 118 [2018-11-07 10:29:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:45,347 INFO L225 Difference]: With dead ends: 136 [2018-11-07 10:29:45,347 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 10:29:45,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:29:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 10:29:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-11-07 10:29:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 10:29:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-11-07 10:29:45,354 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 118 [2018-11-07 10:29:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:45,355 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-11-07 10:29:45,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:29:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-11-07 10:29:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 10:29:45,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:45,356 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:45,356 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:45,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2125992961, now seen corresponding path program 18 times [2018-11-07 10:29:45,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:45,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:45,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:45,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:45,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:45,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:45,798 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:29:45,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:45,798 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:29:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:45,808 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:46,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:46,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:46,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:46,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-07 10:29:47,702 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:47,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:29:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:29:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:29:47,703 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 22 states. [2018-11-07 10:29:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:47,866 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-11-07 10:29:47,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:29:47,866 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2018-11-07 10:29:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:47,867 INFO L225 Difference]: With dead ends: 142 [2018-11-07 10:29:47,868 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 10:29:47,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:29:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 10:29:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-11-07 10:29:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 10:29:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-07 10:29:47,873 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 124 [2018-11-07 10:29:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:47,874 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-07 10:29:47,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:29:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-07 10:29:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 10:29:47,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:47,875 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:47,875 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:47,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:47,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2127762727, now seen corresponding path program 19 times [2018-11-07 10:29:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:47,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:47,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:47,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:47,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:48,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:48,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:48,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:48,257 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:29:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:48,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:48,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:48,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 10:29:48,911 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:48,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:29:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:29:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:29:48,913 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 23 states. [2018-11-07 10:29:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:49,040 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-11-07 10:29:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:29:49,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-11-07 10:29:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:49,042 INFO L225 Difference]: With dead ends: 148 [2018-11-07 10:29:49,042 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 10:29:49,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:29:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 10:29:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-11-07 10:29:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-07 10:29:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-11-07 10:29:49,047 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 130 [2018-11-07 10:29:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:49,048 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-11-07 10:29:49,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:29:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-11-07 10:29:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 10:29:49,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:49,049 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:49,049 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:49,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash 194297935, now seen corresponding path program 20 times [2018-11-07 10:29:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:49,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:49,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:49,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:49,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:49,422 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:49,422 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:29:49,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:49,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 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:29:49,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:49,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:50,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 10:29:50,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:50,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:50,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 10:29:50,773 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:50,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:29:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:29:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:29:50,775 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-11-07 10:29:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:50,896 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-11-07 10:29:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:29:50,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-11-07 10:29:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:50,905 INFO L225 Difference]: With dead ends: 154 [2018-11-07 10:29:50,905 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 10:29:50,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:29:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 10:29:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-11-07 10:29:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-07 10:29:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-07 10:29:50,910 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 136 [2018-11-07 10:29:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:50,911 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-07 10:29:50,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:29:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-07 10:29:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 10:29:50,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:50,912 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:50,912 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:50,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1361276279, now seen corresponding path program 21 times [2018-11-07 10:29:50,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:50,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:50,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:50,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:50,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:51,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:51,240 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:51,240 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:51,240 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:29:51,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:51,240 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:29:51,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:51,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:51,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:51,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:51,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:51,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:52,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:52,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-07 10:29:52,317 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:52,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:29:52,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:29:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:29:52,319 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 25 states. [2018-11-07 10:29:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:52,496 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-11-07 10:29:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:29:52,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-07 10:29:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:52,498 INFO L225 Difference]: With dead ends: 160 [2018-11-07 10:29:52,498 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 10:29:52,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:29:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 10:29:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-11-07 10:29:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-07 10:29:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-11-07 10:29:52,504 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 142 [2018-11-07 10:29:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:52,504 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-11-07 10:29:52,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:29:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-11-07 10:29:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 10:29:52,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:52,505 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:52,506 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:52,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1909089121, now seen corresponding path program 22 times [2018-11-07 10:29:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:52,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:52,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:53,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:53,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:53,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:53,047 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:29:53,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:53,048 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:29:53,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:53,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:53,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:53,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 10:29:53,853 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:53,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:29:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:29:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:29:53,854 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 26 states. [2018-11-07 10:29:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:54,106 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-11-07 10:29:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:29:54,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2018-11-07 10:29:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:54,110 INFO L225 Difference]: With dead ends: 166 [2018-11-07 10:29:54,110 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 10:29:54,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:29:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 10:29:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-11-07 10:29:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 10:29:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-11-07 10:29:54,115 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 148 [2018-11-07 10:29:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:54,116 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-11-07 10:29:54,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:29:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-11-07 10:29:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 10:29:54,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:54,117 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:54,117 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:54,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1096692281, now seen corresponding path program 23 times [2018-11-07 10:29:54,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:54,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:54,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:54,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:54,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:54,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:54,508 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:29:54,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:54,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:29:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:54,517 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:55,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 10:29:55,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:55,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:55,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:55,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:55,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 10:29:55,991 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:55,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:29:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:29:55,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:29:55,992 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 27 states. [2018-11-07 10:29:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:56,162 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-11-07 10:29:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:29:56,165 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-07 10:29:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:56,166 INFO L225 Difference]: With dead ends: 172 [2018-11-07 10:29:56,167 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 10:29:56,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:29:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 10:29:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-11-07 10:29:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-07 10:29:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-11-07 10:29:56,172 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 154 [2018-11-07 10:29:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-11-07 10:29:56,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:29:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-11-07 10:29:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 10:29:56,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:56,174 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:56,174 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:56,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1130266863, now seen corresponding path program 24 times [2018-11-07 10:29:56,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:56,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:56,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:56,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:56,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:56,612 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:56,612 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:29:56,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:56,612 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:29:56,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:56,633 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:56,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:56,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:56,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:56,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-07 10:29:58,083 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:29:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:29:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:29:58,086 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 28 states. [2018-11-07 10:29:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:58,271 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-11-07 10:29:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:29:58,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2018-11-07 10:29:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:58,273 INFO L225 Difference]: With dead ends: 178 [2018-11-07 10:29:58,273 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 10:29:58,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:29:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 10:29:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-07 10:29:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:29:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-11-07 10:29:58,279 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 160 [2018-11-07 10:29:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:58,280 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-11-07 10:29:58,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:29:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-11-07 10:29:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 10:29:58,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:58,281 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:58,282 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:58,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1971177961, now seen corresponding path program 25 times [2018-11-07 10:29:58,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:58,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:58,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:58,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:58,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:58,776 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:29:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:58,777 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:29:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:58,785 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:58,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:58,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:00,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 10:30:00,391 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:00,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:30:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:30:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:30:00,393 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 29 states. [2018-11-07 10:30:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:00,547 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-11-07 10:30:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:30:00,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 166 [2018-11-07 10:30:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:00,549 INFO L225 Difference]: With dead ends: 184 [2018-11-07 10:30:00,550 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 10:30:00,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:30:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 10:30:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-11-07 10:30:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 10:30:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-11-07 10:30:00,555 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 166 [2018-11-07 10:30:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:00,556 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-11-07 10:30:00,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:30:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-11-07 10:30:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 10:30:00,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:00,557 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:00,557 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:00,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1220317889, now seen corresponding path program 26 times [2018-11-07 10:30:00,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:00,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:00,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:01,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:01,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:01,479 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:01,479 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:30:01,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:01,480 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:30:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:01,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:04,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 10:30:04,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:04,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:04,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:05,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:05,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 10:30:05,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:30:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:30:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:30:05,150 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 30 states. [2018-11-07 10:30:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:06,639 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-11-07 10:30:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:30:06,639 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 172 [2018-11-07 10:30:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:06,640 INFO L225 Difference]: With dead ends: 190 [2018-11-07 10:30:06,640 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 10:30:06,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:30:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 10:30:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-11-07 10:30:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 10:30:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-11-07 10:30:06,646 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 172 [2018-11-07 10:30:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:06,647 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-11-07 10:30:06,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:30:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-11-07 10:30:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 10:30:06,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:06,648 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:06,648 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:06,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1241032295, now seen corresponding path program 27 times [2018-11-07 10:30:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:06,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:06,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:08,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:08,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:08,359 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:08,359 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:30:08,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:08,359 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:30:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:08,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:09,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:09,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:09,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:09,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:10,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-07 10:30:10,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:10,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:30:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:30:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 10:30:10,934 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 31 states. [2018-11-07 10:30:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:11,180 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-11-07 10:30:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:30:11,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 178 [2018-11-07 10:30:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:11,183 INFO L225 Difference]: With dead ends: 196 [2018-11-07 10:30:11,183 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 10:30:11,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 10:30:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 10:30:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-11-07 10:30:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-07 10:30:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-11-07 10:30:11,189 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 178 [2018-11-07 10:30:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:11,190 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-11-07 10:30:11,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:30:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-11-07 10:30:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 10:30:11,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:11,191 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:11,192 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:11,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -937926257, now seen corresponding path program 28 times [2018-11-07 10:30:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:11,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:11,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:11,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:11,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:11,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:11,873 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:30:11,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:11,873 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:30:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:11,883 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:11,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:12,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:13,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:13,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 10:30:13,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:13,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:30:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:30:13,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:30:13,087 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 32 states. [2018-11-07 10:30:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:13,309 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-11-07 10:30:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:30:13,310 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 184 [2018-11-07 10:30:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:13,312 INFO L225 Difference]: With dead ends: 202 [2018-11-07 10:30:13,312 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 10:30:13,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:30:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 10:30:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-11-07 10:30:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 10:30:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-11-07 10:30:13,318 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 184 [2018-11-07 10:30:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:13,319 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-11-07 10:30:13,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:30:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-11-07 10:30:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 10:30:13,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:13,320 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:13,321 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:13,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1681465015, now seen corresponding path program 29 times [2018-11-07 10:30:13,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:13,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:13,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:13,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:13,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:13,836 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:30:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:13,836 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:30:13,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:13,844 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:18,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 10:30:18,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:18,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:18,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 10:30:19,564 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:19,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:30:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:30:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:30:19,565 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 33 states. [2018-11-07 10:30:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:19,740 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-11-07 10:30:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:30:19,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 190 [2018-11-07 10:30:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:19,743 INFO L225 Difference]: With dead ends: 208 [2018-11-07 10:30:19,743 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 10:30:19,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:30:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 10:30:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-11-07 10:30:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-07 10:30:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-11-07 10:30:19,749 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 190 [2018-11-07 10:30:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:19,749 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-11-07 10:30:19,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:30:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-11-07 10:30:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-07 10:30:19,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:19,751 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:19,751 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:19,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1508811297, now seen corresponding path program 30 times [2018-11-07 10:30:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:19,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:19,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:20,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:20,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:20,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:20,273 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:30:20,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:20,273 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:30:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:20,283 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:20,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:20,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:20,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:20,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:21,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:21,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-07 10:30:21,680 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:21,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:30:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:30:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 10:30:21,681 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 34 states. [2018-11-07 10:30:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:21,910 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-11-07 10:30:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:30:21,910 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 196 [2018-11-07 10:30:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:21,911 INFO L225 Difference]: With dead ends: 214 [2018-11-07 10:30:21,911 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 10:30:21,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 10:30:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 10:30:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-07 10:30:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-07 10:30:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-11-07 10:30:21,917 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 196 [2018-11-07 10:30:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:21,918 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-11-07 10:30:21,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:30:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-11-07 10:30:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 10:30:21,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:21,919 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:21,919 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:21,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 309829383, now seen corresponding path program 31 times [2018-11-07 10:30:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:21,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:21,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:21,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:22,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:22,609 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:22,609 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:22,609 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:30:22,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:22,609 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:30:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:22,634 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:22,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:22,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:24,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 10:30:24,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:24,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:30:24,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:30:24,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:30:24,343 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 35 states. [2018-11-07 10:30:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:24,978 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-11-07 10:30:24,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:30:24,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2018-11-07 10:30:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:24,979 INFO L225 Difference]: With dead ends: 220 [2018-11-07 10:30:24,980 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 10:30:24,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:30:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 10:30:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2018-11-07 10:30:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-07 10:30:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-11-07 10:30:24,985 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 202 [2018-11-07 10:30:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:24,986 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-11-07 10:30:24,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:30:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-11-07 10:30:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-07 10:30:24,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:24,987 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:24,988 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -748527057, now seen corresponding path program 32 times [2018-11-07 10:30:24,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:24,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:24,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:24,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:24,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:25,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:25,596 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:25,596 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:30:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:25,596 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:30:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:25,605 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:32,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 10:30:32,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:32,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:32,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 10:30:33,358 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:30:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:30:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:30:33,360 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 36 states. [2018-11-07 10:30:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:33,672 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-11-07 10:30:33,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:30:33,673 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 208 [2018-11-07 10:30:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:33,674 INFO L225 Difference]: With dead ends: 226 [2018-11-07 10:30:33,674 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 10:30:33,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:30:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 10:30:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-11-07 10:30:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-07 10:30:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-11-07 10:30:33,680 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 208 [2018-11-07 10:30:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:33,681 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-11-07 10:30:33,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:30:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-11-07 10:30:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 10:30:33,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:33,683 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:33,683 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:33,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1609049943, now seen corresponding path program 33 times [2018-11-07 10:30:33,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:33,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:33,685 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:34,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:34,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:34,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:34,561 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:30:34,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:34,562 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:30:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:34,570 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:36,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:36,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:36,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:36,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:37,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-07 10:30:37,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:37,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:30:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:30:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 10:30:37,871 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 37 states. [2018-11-07 10:30:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:38,111 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-11-07 10:30:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 10:30:38,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 214 [2018-11-07 10:30:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:38,113 INFO L225 Difference]: With dead ends: 232 [2018-11-07 10:30:38,113 INFO L226 Difference]: Without dead ends: 225 [2018-11-07 10:30:38,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 10:30:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-07 10:30:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-11-07 10:30:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 10:30:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-11-07 10:30:38,120 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 214 [2018-11-07 10:30:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:38,120 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-11-07 10:30:38,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:30:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-11-07 10:30:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 10:30:38,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:38,122 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:38,122 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:38,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash 608136831, now seen corresponding path program 34 times [2018-11-07 10:30:38,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:38,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:38,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:39,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:39,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:39,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:39,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:39,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:39,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:39,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:39,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:39,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 10:30:40,843 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:40,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:30:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:30:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:30:40,845 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 38 states. [2018-11-07 10:30:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:41,076 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-11-07 10:30:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:30:41,076 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 220 [2018-11-07 10:30:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:41,077 INFO L225 Difference]: With dead ends: 238 [2018-11-07 10:30:41,077 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 10:30:41,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:30:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 10:30:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-11-07 10:30:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 10:30:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-11-07 10:30:41,083 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 220 [2018-11-07 10:30:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:41,084 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-11-07 10:30:41,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:30:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-11-07 10:30:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 10:30:41,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:41,085 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:41,086 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:41,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 700364711, now seen corresponding path program 35 times [2018-11-07 10:30:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:41,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:41,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:42,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:42,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:42,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:42,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:42,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:42,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:42,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:42,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:52,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 10:30:52,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:52,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:52,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 10:30:53,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:30:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:30:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:30:53,746 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 39 states. [2018-11-07 10:30:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:53,989 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-11-07 10:30:53,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:30:53,990 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 226 [2018-11-07 10:30:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:53,991 INFO L225 Difference]: With dead ends: 244 [2018-11-07 10:30:53,991 INFO L226 Difference]: Without dead ends: 237 [2018-11-07 10:30:53,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:30:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-07 10:30:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-11-07 10:30:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-07 10:30:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-11-07 10:30:53,996 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 226 [2018-11-07 10:30:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:53,996 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-11-07 10:30:53,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:30:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-11-07 10:30:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-07 10:30:53,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:53,998 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:53,998 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:53,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1092844849, now seen corresponding path program 36 times [2018-11-07 10:30:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:54,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:54,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:54,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:54,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:54,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:54,800 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:30:54,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:54,800 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:30:54,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:54,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:56,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:56,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:56,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:56,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:58,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:58,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-07 10:30:58,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:58,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:30:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:30:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:30:58,103 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 40 states. [2018-11-07 10:30:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:58,311 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-11-07 10:30:58,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:30:58,312 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 232 [2018-11-07 10:30:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:58,314 INFO L225 Difference]: With dead ends: 250 [2018-11-07 10:30:58,314 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 10:30:58,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:30:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 10:30:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-11-07 10:30:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-07 10:30:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-11-07 10:30:58,319 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 232 [2018-11-07 10:30:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:58,319 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-11-07 10:30:58,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:30:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-11-07 10:30:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-07 10:30:58,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:58,321 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:58,321 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:58,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash 523194359, now seen corresponding path program 37 times [2018-11-07 10:30:58,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:58,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:58,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:59,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:59,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:59,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:59,272 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:30:59,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:59,272 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:30:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:59,281 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:59,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:30:59,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 10:31:01,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:01,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:31:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:31:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:31:01,616 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 41 states. [2018-11-07 10:31:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:01,858 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-11-07 10:31:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:31:01,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 238 [2018-11-07 10:31:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:01,866 INFO L225 Difference]: With dead ends: 256 [2018-11-07 10:31:01,866 INFO L226 Difference]: Without dead ends: 249 [2018-11-07 10:31:01,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:31:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-07 10:31:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-11-07 10:31:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-07 10:31:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-11-07 10:31:01,872 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 238 [2018-11-07 10:31:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:01,872 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-11-07 10:31:01,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:31:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-11-07 10:31:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-07 10:31:01,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:01,874 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:01,874 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:01,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 460168991, now seen corresponding path program 38 times [2018-11-07 10:31:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:01,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:02,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:02,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:02,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:02,732 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:31:02,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:02,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:02,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:31:02,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:31:19,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 10:31:19,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:19,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:19,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:21,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:21,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 10:31:21,306 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:21,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:31:21,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:31:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:31:21,307 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 42 states. [2018-11-07 10:31:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:21,562 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-11-07 10:31:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:31:21,562 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 244 [2018-11-07 10:31:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:21,564 INFO L225 Difference]: With dead ends: 262 [2018-11-07 10:31:21,564 INFO L226 Difference]: Without dead ends: 255 [2018-11-07 10:31:21,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:31:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-07 10:31:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2018-11-07 10:31:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 10:31:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-11-07 10:31:21,569 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 244 [2018-11-07 10:31:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:21,570 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-11-07 10:31:21,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:31:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-11-07 10:31:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-07 10:31:21,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:21,572 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:21,572 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1049759673, now seen corresponding path program 39 times [2018-11-07 10:31:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:21,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:21,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:22,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:22,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:22,315 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:22,315 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:31:22,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:22,315 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:31:22,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:31:22,325 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:31:22,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:31:22,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:22,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:22,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:24,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-07 10:31:24,717 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:24,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:31:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:31:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 10:31:24,718 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 43 states. [2018-11-07 10:31:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:25,026 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-11-07 10:31:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:31:25,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 250 [2018-11-07 10:31:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:25,028 INFO L225 Difference]: With dead ends: 268 [2018-11-07 10:31:25,028 INFO L226 Difference]: Without dead ends: 261 [2018-11-07 10:31:25,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 10:31:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-07 10:31:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2018-11-07 10:31:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-07 10:31:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-11-07 10:31:25,034 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 250 [2018-11-07 10:31:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:25,034 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-11-07 10:31:25,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:31:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-11-07 10:31:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-07 10:31:25,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:25,036 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:25,036 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:25,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 69649263, now seen corresponding path program 40 times [2018-11-07 10:31:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:25,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:25,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:25,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:25,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:25,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:25,923 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:31:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:25,923 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:31:25,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:25,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:31:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:26,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:26,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:27,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:27,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 10:31:27,955 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:27,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:31:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:31:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:31:27,957 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 44 states. [2018-11-07 10:31:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:28,239 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-11-07 10:31:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:31:28,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 256 [2018-11-07 10:31:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:28,241 INFO L225 Difference]: With dead ends: 274 [2018-11-07 10:31:28,241 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 10:31:28,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:31:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 10:31:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-11-07 10:31:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-07 10:31:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-11-07 10:31:28,247 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 256 [2018-11-07 10:31:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:28,247 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-11-07 10:31:28,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:31:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-11-07 10:31:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-07 10:31:28,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:28,249 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:28,249 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1672386711, now seen corresponding path program 41 times [2018-11-07 10:31:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:28,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:29,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:29,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:29,135 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:31:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:29,135 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:31:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:31:29,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:02,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 10:32:02,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:02,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:02,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:04,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:04,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 10:32:04,051 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:04,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:32:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:32:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:32:04,053 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 45 states. [2018-11-07 10:32:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:04,308 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-11-07 10:32:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:32:04,311 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 262 [2018-11-07 10:32:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:04,313 INFO L225 Difference]: With dead ends: 280 [2018-11-07 10:32:04,313 INFO L226 Difference]: Without dead ends: 273 [2018-11-07 10:32:04,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:32:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-07 10:32:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2018-11-07 10:32:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-07 10:32:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-11-07 10:32:04,318 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 262 [2018-11-07 10:32:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:04,319 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-11-07 10:32:04,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:32:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-11-07 10:32:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-07 10:32:04,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:04,321 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:04,321 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:04,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1791234113, now seen corresponding path program 42 times [2018-11-07 10:32:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:04,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:04,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:05,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:05,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:05,251 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:05,252 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:32:05,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:05,252 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:32:05,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:05,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:10,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:10,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:10,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:10,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:12,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:12,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-07 10:32:12,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:12,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:32:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:32:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 10:32:12,856 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 46 states. [2018-11-07 10:32:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:13,115 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-11-07 10:32:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 10:32:13,116 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 268 [2018-11-07 10:32:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:13,117 INFO L225 Difference]: With dead ends: 286 [2018-11-07 10:32:13,118 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 10:32:13,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 10:32:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 10:32:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-11-07 10:32:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-07 10:32:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-11-07 10:32:13,124 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 268 [2018-11-07 10:32:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:13,124 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-11-07 10:32:13,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:32:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-11-07 10:32:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 10:32:13,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:13,126 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:13,126 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:13,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash 723863783, now seen corresponding path program 43 times [2018-11-07 10:32:13,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:13,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:13,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:14,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:14,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:14,278 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:14,278 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:32:14,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:14,279 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:32:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:14,289 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:14,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:16,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:16,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 10:32:16,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:16,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:32:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:32:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:32:16,871 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 47 states. [2018-11-07 10:32:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:17,142 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-11-07 10:32:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 10:32:17,142 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 274 [2018-11-07 10:32:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:17,144 INFO L225 Difference]: With dead ends: 292 [2018-11-07 10:32:17,144 INFO L226 Difference]: Without dead ends: 285 [2018-11-07 10:32:17,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:32:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-07 10:32:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2018-11-07 10:32:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-07 10:32:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-11-07 10:32:17,150 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 274 [2018-11-07 10:32:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:17,151 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-11-07 10:32:17,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:32:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-11-07 10:32:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 10:32:17,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:17,152 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:17,153 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:17,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1021387791, now seen corresponding path program 44 times [2018-11-07 10:32:17,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:18,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:18,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:18,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:18,159 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:32:18,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:18,159 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:32:18,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:18,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:00,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 10:33:00,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:00,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:00,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 10:33:02,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:02,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:33:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:33:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 10:33:02,578 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 48 states. [2018-11-07 10:33:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:02,907 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-11-07 10:33:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:33:02,908 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 280 [2018-11-07 10:33:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:02,910 INFO L225 Difference]: With dead ends: 298 [2018-11-07 10:33:02,910 INFO L226 Difference]: Without dead ends: 291 [2018-11-07 10:33:02,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 10:33:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-07 10:33:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-11-07 10:33:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-07 10:33:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-11-07 10:33:02,917 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 280 [2018-11-07 10:33:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:02,917 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-11-07 10:33:02,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:33:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-11-07 10:33:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-07 10:33:02,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:02,919 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:02,919 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:02,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash 252051767, now seen corresponding path program 45 times [2018-11-07 10:33:02,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:02,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:02,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:03,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:03,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:03,876 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:33:03,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,877 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:33:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:03,887 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:04,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:04,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:04,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:06,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:06,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-11-07 10:33:06,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:06,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:33:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:33:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:33:06,582 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 49 states. [2018-11-07 10:33:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:07,308 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-11-07 10:33:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:33:07,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 286 [2018-11-07 10:33:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:07,310 INFO L225 Difference]: With dead ends: 304 [2018-11-07 10:33:07,311 INFO L226 Difference]: Without dead ends: 297 [2018-11-07 10:33:07,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:33:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-07 10:33:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2018-11-07 10:33:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 10:33:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-11-07 10:33:07,319 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 286 [2018-11-07 10:33:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:07,320 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-11-07 10:33:07,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:33:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-11-07 10:33:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-07 10:33:07,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:07,322 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:07,323 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:07,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1152753569, now seen corresponding path program 46 times [2018-11-07 10:33:07,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:07,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:07,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:09,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:09,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:09,876 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:33:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:09,876 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:33:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:09,886 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:09,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:10,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:12,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:12,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 10:33:12,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:12,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:33:12,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:33:12,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:33:12,739 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 50 states. [2018-11-07 10:33:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:13,044 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-11-07 10:33:13,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:33:13,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 292 [2018-11-07 10:33:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:13,047 INFO L225 Difference]: With dead ends: 310 [2018-11-07 10:33:13,047 INFO L226 Difference]: Without dead ends: 303 [2018-11-07 10:33:13,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:33:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-07 10:33:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-11-07 10:33:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 10:33:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-11-07 10:33:13,053 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 292 [2018-11-07 10:33:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:13,054 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-11-07 10:33:13,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:33:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-11-07 10:33:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-07 10:33:13,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:13,056 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:13,056 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:13,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -662388345, now seen corresponding path program 47 times [2018-11-07 10:33:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:13,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:13,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:14,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:14,220 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:14,221 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:14,221 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:33:14,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:14,221 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:33:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:14,229 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown