java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:40:00,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:40:00,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:40:00,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:40:00,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:40:00,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:40:00,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:40:00,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:40:00,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:40:00,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:40:00,422 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:40:00,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:40:00,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:40:00,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:40:00,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:40:00,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:40:00,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:40:00,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:40:00,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:40:00,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:40:00,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:40:00,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:40:00,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:40:00,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:40:00,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:40:00,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:40:00,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:40:00,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:40:00,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:40:00,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:40:00,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:40:00,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:40:00,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:40:00,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:40:00,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:40:00,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:40:00,445 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:40:00,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:40:00,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:40:00,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:40:00,462 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:40:00,462 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:40:00,462 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:40:00,462 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:40:00,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:40:00,463 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:40:00,463 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:40:00,463 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:40:00,463 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:40:00,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:40:00,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:40:00,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:40:00,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:40:00,465 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:40:00,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:40:00,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:40:00,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:40:00,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:40:00,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:40:00,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:40:00,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:40:00,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:40:00,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:00,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:40:00,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:40:00,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:40:00,467 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:40:00,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:40:00,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:40:00,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:40:00,468 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:40:00,468 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:40:00,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:40:00,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:40:00,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:40:00,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:40:00,546 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:40:00,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-12 20:40:00,611 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c891364ed/4616d01019ed4bd6b4ac8a8292da3851/FLAG5a44332cd [2018-11-12 20:40:01,009 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:40:01,010 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-12 20:40:01,015 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c891364ed/4616d01019ed4bd6b4ac8a8292da3851/FLAG5a44332cd [2018-11-12 20:40:01,029 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c891364ed/4616d01019ed4bd6b4ac8a8292da3851 [2018-11-12 20:40:01,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:40:01,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:40:01,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:01,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:40:01,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:40:01,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5d439d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01, skipping insertion in model container [2018-11-12 20:40:01,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:40:01,092 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:40:01,313 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:01,316 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:40:01,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:01,348 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:40:01,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01 WrapperNode [2018-11-12 20:40:01,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:01,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:01,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:40:01,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:40:01,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:01,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:40:01,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:40:01,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:40:01,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... [2018-11-12 20:40:01,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:40:01,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:40:01,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:40:01,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:40:01,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:40:01,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:40:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:40:01,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:40:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:40:01,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:40:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:40:01,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:40:01,833 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:40:01,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:01 BoogieIcfgContainer [2018-11-12 20:40:01,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:40:01,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:40:01,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:40:01,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:40:01,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:40:01" (1/3) ... [2018-11-12 20:40:01,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21615e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:01, skipping insertion in model container [2018-11-12 20:40:01,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:01" (2/3) ... [2018-11-12 20:40:01,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21615e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:01, skipping insertion in model container [2018-11-12 20:40:01,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:01" (3/3) ... [2018-11-12 20:40:01,850 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i [2018-11-12 20:40:01,857 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:40:01,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:40:01,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:40:01,911 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:40:01,911 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:40:01,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:40:01,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:40:01,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:40:01,912 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:40:01,912 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:40:01,913 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:40:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-12 20:40:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:40:01,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:01,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:01,940 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:01,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash -745796184, now seen corresponding path program 1 times [2018-11-12 20:40:01,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:01,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:01,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:02,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:40:02,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:02,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:40:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:40:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:40:02,072 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-12 20:40:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:02,093 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-12 20:40:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:40:02,095 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-12 20:40:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:02,104 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:40:02,104 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:40:02,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:40:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:40:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:40:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:40:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-12 20:40:02,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-12 20:40:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:02,145 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-12 20:40:02,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:40:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-12 20:40:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:02,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:02,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:02,147 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:02,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 800081396, now seen corresponding path program 1 times [2018-11-12 20:40:02,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:02,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:02,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:02,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:02,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:02,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:02,289 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-12 20:40:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:02,417 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-12 20:40:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:02,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-12 20:40:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:02,418 INFO L225 Difference]: With dead ends: 32 [2018-11-12 20:40:02,419 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:40:02,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:40:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-12 20:40:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:40:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-12 20:40:02,426 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-12 20:40:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:02,426 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-12 20:40:02,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-12 20:40:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:40:02,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:02,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:02,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:02,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1097925811, now seen corresponding path program 1 times [2018-11-12 20:40:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:40:02,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:02,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:02,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:02,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:02,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:02,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:02,538 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-12 20:40:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:02,714 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-12 20:40:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:02,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-12 20:40:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:02,716 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:40:02,716 INFO L226 Difference]: Without dead ends: 29 [2018-11-12 20:40:02,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-12 20:40:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-12 20:40:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:40:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-12 20:40:02,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-11-12 20:40:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:02,723 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-12 20:40:02,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-12 20:40:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:40:02,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:02,724 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:02,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -278190259, now seen corresponding path program 1 times [2018-11-12 20:40:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:02,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:02,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-12 20:40:02,930 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-12 20:40:02,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:02,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:03,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:03,368 INFO L272 AbstractInterpreter]: Visited 19 different actions 92 times. Merged at 5 different actions 43 times. Widened at 1 different actions 5 times. Performed 353 root evaluator evaluations with a maximum evaluation depth of 4. Performed 353 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-12 20:40:03,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:03,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:03,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:03,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:03,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:03,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:03,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:03,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-12 20:40:03,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:03,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:03,716 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-12 20:40:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:03,939 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-12 20:40:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:03,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-12 20:40:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:03,942 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:40:03,942 INFO L226 Difference]: Without dead ends: 53 [2018-11-12 20:40:03,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-12 20:40:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-12 20:40:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:40:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-12 20:40:03,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 21 [2018-11-12 20:40:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:03,950 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-12 20:40:03,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-12 20:40:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:40:03,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:03,952 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:03,952 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:03,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2006845708, now seen corresponding path program 1 times [2018-11-12 20:40:03,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:03,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:03,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:04,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:04,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:04,117 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-12 20:40:04,117 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [17], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-12 20:40:04,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:04,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:04,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:04,343 INFO L272 AbstractInterpreter]: Visited 20 different actions 147 times. Merged at 10 different actions 84 times. Widened at 3 different actions 11 times. Performed 669 root evaluator evaluations with a maximum evaluation depth of 4. Performed 669 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 4 different actions. Largest state had 7 variables. [2018-11-12 20:40:04,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:04,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:04,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:04,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:04,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:04,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:04,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:04,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:40:05,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:05,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:40:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:40:05,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:05,030 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-12 20:40:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:05,157 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-12 20:40:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:40:05,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-12 20:40:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:05,161 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:40:05,161 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:40:05,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:40:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:40:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-12 20:40:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-12 20:40:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-12 20:40:05,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2018-11-12 20:40:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:05,170 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-12 20:40:05,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:40:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-12 20:40:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-12 20:40:05,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:05,172 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:05,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:05,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 750227251, now seen corresponding path program 2 times [2018-11-12 20:40:05,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:05,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:05,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:05,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:05,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:05,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:05,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:05,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:05,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:40:05,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:05,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:40:05,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:40:05,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:05,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2018-11-12 20:40:05,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:05,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:40:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:40:05,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:40:05,730 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-11-12 20:40:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:06,045 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-11-12 20:40:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:40:06,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-12 20:40:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:06,049 INFO L225 Difference]: With dead ends: 112 [2018-11-12 20:40:06,049 INFO L226 Difference]: Without dead ends: 100 [2018-11-12 20:40:06,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:40:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-12 20:40:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-11-12 20:40:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-12 20:40:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-12 20:40:06,058 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 33 [2018-11-12 20:40:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:06,058 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-12 20:40:06,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:40:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-12 20:40:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:40:06,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:06,060 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:06,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1707835635, now seen corresponding path program 3 times [2018-11-12 20:40:06,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:06,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:06,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:06,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:06,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:06,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:06,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:06,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:06,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:06,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:06,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:40:06,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:06,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:40:06,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:40:06,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:06,735 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-11-12 20:40:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:06,941 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-12 20:40:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:40:06,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-12 20:40:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:06,945 INFO L225 Difference]: With dead ends: 122 [2018-11-12 20:40:06,945 INFO L226 Difference]: Without dead ends: 116 [2018-11-12 20:40:06,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-12 20:40:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 77. [2018-11-12 20:40:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:40:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-12 20:40:06,956 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 45 [2018-11-12 20:40:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:06,956 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-12 20:40:06,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:40:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-12 20:40:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-12 20:40:06,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:06,958 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:06,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:06,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1071743214, now seen corresponding path program 4 times [2018-11-12 20:40:06,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,220 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-12 20:40:07,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:07,221 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:07,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:07,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:07,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:07,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:07,331 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-12 20:40:07,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:07,741 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-12 20:40:07,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:07,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:40:07,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:07,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:40:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:40:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:40:07,763 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 15 states. [2018-11-12 20:40:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:07,938 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-11-12 20:40:07,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:40:07,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-12 20:40:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:07,941 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:40:07,941 INFO L226 Difference]: Without dead ends: 123 [2018-11-12 20:40:07,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:40:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-12 20:40:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2018-11-12 20:40:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:40:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-12 20:40:07,949 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 48 [2018-11-12 20:40:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:07,950 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-12 20:40:07,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:40:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-12 20:40:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:40:07,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:07,952 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:07,952 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:07,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:07,952 INFO L82 PathProgramCache]: Analyzing trace with hash 535766893, now seen corresponding path program 5 times [2018-11-12 20:40:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:07,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:07,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:08,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:08,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:08,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:08,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:08,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:08,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:08,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:40:08,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:08,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:40:08,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:40:08,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:08,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 26 [2018-11-12 20:40:08,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:08,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:40:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:40:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:08,529 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 20 states. [2018-11-12 20:40:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:08,826 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2018-11-12 20:40:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:40:08,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-12 20:40:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:08,829 INFO L225 Difference]: With dead ends: 181 [2018-11-12 20:40:08,829 INFO L226 Difference]: Without dead ends: 167 [2018-11-12 20:40:08,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-12 20:40:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2018-11-12 20:40:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-11-12 20:40:08,839 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 51 [2018-11-12 20:40:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:08,840 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-11-12 20:40:08,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:40:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-11-12 20:40:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-12 20:40:08,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:08,842 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:08,842 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:08,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash 227276404, now seen corresponding path program 6 times [2018-11-12 20:40:08,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:08,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:08,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:09,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:09,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:09,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:09,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:09,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:09,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:09,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:09,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:09,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:09,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:10,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:40:10,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:10,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:40:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:40:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:40:10,176 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 21 states. [2018-11-12 20:40:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:10,364 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-11-12 20:40:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:40:10,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-12 20:40:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:10,367 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:40:10,367 INFO L226 Difference]: Without dead ends: 180 [2018-11-12 20:40:10,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:40:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-12 20:40:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 122. [2018-11-12 20:40:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-12 20:40:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-11-12 20:40:10,377 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 66 [2018-11-12 20:40:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:10,377 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-11-12 20:40:10,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:40:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-12 20:40:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:10,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:10,379 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:10,379 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:10,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1732418355, now seen corresponding path program 7 times [2018-11-12 20:40:10,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:10,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:10,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:10,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:10,679 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:10,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:10,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:10,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:10,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:10,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:40:11,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:11,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:40:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:40:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:40:11,309 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 22 states. [2018-11-12 20:40:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:11,495 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2018-11-12 20:40:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:40:11,495 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-11-12 20:40:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:11,497 INFO L225 Difference]: With dead ends: 193 [2018-11-12 20:40:11,498 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:40:11,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:40:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:40:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2018-11-12 20:40:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-12 20:40:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2018-11-12 20:40:11,505 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 69 [2018-11-12 20:40:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:11,506 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2018-11-12 20:40:11,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:40:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2018-11-12 20:40:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-12 20:40:11,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:11,507 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:11,508 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1957710356, now seen corresponding path program 8 times [2018-11-12 20:40:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:11,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:11,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:11,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:11,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:11,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:11,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:40:11,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:11,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-12 20:40:12,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-12 20:40:13,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:13,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9, 9] total 35 [2018-11-12 20:40:13,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:13,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:40:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:40:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:40:13,024 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 28 states. [2018-11-12 20:40:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:13,362 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-11-12 20:40:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:40:13,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2018-11-12 20:40:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:13,365 INFO L225 Difference]: With dead ends: 263 [2018-11-12 20:40:13,365 INFO L226 Difference]: Without dead ends: 247 [2018-11-12 20:40:13,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:40:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-12 20:40:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2018-11-12 20:40:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:40:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-12 20:40:13,374 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 72 [2018-11-12 20:40:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:13,375 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-12 20:40:13,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:40:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-12 20:40:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-12 20:40:13,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:13,379 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:13,380 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:13,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1693515634, now seen corresponding path program 9 times [2018-11-12 20:40:13,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:13,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:13,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:14,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:14,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:14,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:14,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:14,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:14,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:14,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-12 20:40:16,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:16,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:40:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:40:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:40:16,334 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 29 states. [2018-11-12 20:40:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:16,632 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2018-11-12 20:40:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:40:16,633 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-11-12 20:40:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:16,637 INFO L225 Difference]: With dead ends: 260 [2018-11-12 20:40:16,637 INFO L226 Difference]: Without dead ends: 254 [2018-11-12 20:40:16,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:40:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-12 20:40:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-12 20:40:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-12 20:40:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2018-11-12 20:40:16,645 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 90 [2018-11-12 20:40:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:16,646 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2018-11-12 20:40:16,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:40:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2018-11-12 20:40:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-12 20:40:16,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:16,648 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:16,648 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:16,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1143150669, now seen corresponding path program 10 times [2018-11-12 20:40:16,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:16,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:16,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:16,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:16,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:17,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:17,579 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:17,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:17,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:17,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:17,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:17,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:18,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:18,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-12 20:40:18,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:18,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:40:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:40:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:40:18,628 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand 30 states. [2018-11-12 20:40:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:18,953 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2018-11-12 20:40:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:40:18,953 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-11-12 20:40:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:18,956 INFO L225 Difference]: With dead ends: 267 [2018-11-12 20:40:18,956 INFO L226 Difference]: Without dead ends: 261 [2018-11-12 20:40:18,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:40:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-12 20:40:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 181. [2018-11-12 20:40:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-12 20:40:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-11-12 20:40:18,963 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 93 [2018-11-12 20:40:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:18,964 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-11-12 20:40:18,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:40:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-11-12 20:40:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-12 20:40:18,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:18,965 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:18,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:18,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 492467246, now seen corresponding path program 11 times [2018-11-12 20:40:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:19,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:19,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:19,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:19,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:19,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:19,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:40:19,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:19,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-12 20:40:19,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-12 20:40:20,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:20,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10, 10] total 45 [2018-11-12 20:40:20,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:20,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:40:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:40:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:40:20,267 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 37 states. [2018-11-12 20:40:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:20,766 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2018-11-12 20:40:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:40:20,775 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-11-12 20:40:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:20,777 INFO L225 Difference]: With dead ends: 358 [2018-11-12 20:40:20,777 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 20:40:20,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:40:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 20:40:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 226. [2018-11-12 20:40:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-12 20:40:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2018-11-12 20:40:20,784 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 96 [2018-11-12 20:40:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:20,785 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2018-11-12 20:40:20,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:40:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2018-11-12 20:40:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 20:40:20,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:20,787 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:20,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:20,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 494608371, now seen corresponding path program 12 times [2018-11-12 20:40:20,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:21,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:21,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:21,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:21,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:21,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:21,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:21,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:21,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:21,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:21,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:21,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:21,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:23,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-12 20:40:23,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:23,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:40:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:40:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:40:23,208 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand 38 states. [2018-11-12 20:40:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:23,630 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-11-12 20:40:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:40:23,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-11-12 20:40:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:23,634 INFO L225 Difference]: With dead ends: 344 [2018-11-12 20:40:23,634 INFO L226 Difference]: Without dead ends: 338 [2018-11-12 20:40:23,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:40:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-12 20:40:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 233. [2018-11-12 20:40:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-12 20:40:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-11-12 20:40:23,642 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 117 [2018-11-12 20:40:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:23,643 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-11-12 20:40:23,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:40:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-11-12 20:40:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-12 20:40:23,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:23,644 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:23,645 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:23,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash -612030252, now seen corresponding path program 13 times [2018-11-12 20:40:23,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:24,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:24,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:24,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:24,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:24,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:24,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-12 20:40:26,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:26,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:40:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:40:26,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:40:26,327 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 39 states. [2018-11-12 20:40:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:26,797 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-11-12 20:40:26,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:40:26,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-11-12 20:40:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:26,800 INFO L225 Difference]: With dead ends: 351 [2018-11-12 20:40:26,800 INFO L226 Difference]: Without dead ends: 345 [2018-11-12 20:40:26,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:40:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-12 20:40:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 240. [2018-11-12 20:40:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-12 20:40:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2018-11-12 20:40:26,808 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 120 [2018-11-12 20:40:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:26,809 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2018-11-12 20:40:26,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:40:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2018-11-12 20:40:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 20:40:26,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:26,810 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:26,811 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:26,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash -314283949, now seen corresponding path program 14 times [2018-11-12 20:40:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 1368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:27,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:27,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:27,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:27,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:27,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:27,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:27,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:27,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:27,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:40:27,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:27,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-12 20:40:27,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-12 20:40:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 11, 11] total 56 [2018-11-12 20:40:28,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:28,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:40:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:40:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:40:28,156 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand 47 states. [2018-11-12 20:40:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:29,753 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2018-11-12 20:40:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:40:29,754 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 123 [2018-11-12 20:40:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:29,757 INFO L225 Difference]: With dead ends: 466 [2018-11-12 20:40:29,757 INFO L226 Difference]: Without dead ends: 446 [2018-11-12 20:40:29,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:40:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-12 20:40:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 292. [2018-11-12 20:40:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-12 20:40:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 329 transitions. [2018-11-12 20:40:29,769 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 329 transitions. Word has length 123 [2018-11-12 20:40:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:29,769 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 329 transitions. [2018-11-12 20:40:29,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:40:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 329 transitions. [2018-11-12 20:40:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 20:40:29,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:29,771 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:29,771 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:29,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash -755226131, now seen corresponding path program 15 times [2018-11-12 20:40:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:29,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:29,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:30,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:30,946 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:30,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:30,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:30,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:30,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:31,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:31,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:31,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:31,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:33,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-12 20:40:33,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:33,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:40:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:40:33,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:40:33,671 INFO L87 Difference]: Start difference. First operand 292 states and 329 transitions. Second operand 48 states. [2018-11-12 20:40:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:34,241 INFO L93 Difference]: Finished difference Result 438 states and 483 transitions. [2018-11-12 20:40:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:40:34,248 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-11-12 20:40:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:34,250 INFO L225 Difference]: With dead ends: 438 [2018-11-12 20:40:34,250 INFO L226 Difference]: Without dead ends: 432 [2018-11-12 20:40:34,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2018-11-12 20:40:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-12 20:40:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 299. [2018-11-12 20:40:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-12 20:40:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 337 transitions. [2018-11-12 20:40:34,259 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 337 transitions. Word has length 147 [2018-11-12 20:40:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 337 transitions. [2018-11-12 20:40:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:40:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 337 transitions. [2018-11-12 20:40:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-12 20:40:34,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:34,261 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:34,261 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:34,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1973406962, now seen corresponding path program 16 times [2018-11-12 20:40:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:34,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:34,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:35,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:35,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:35,228 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:35,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:35,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:35,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:35,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:35,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:35,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:35,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:37,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-12 20:40:37,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:37,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:40:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:40:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:40:37,803 INFO L87 Difference]: Start difference. First operand 299 states and 337 transitions. Second operand 49 states. [2018-11-12 20:40:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:38,747 INFO L93 Difference]: Finished difference Result 445 states and 491 transitions. [2018-11-12 20:40:38,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:40:38,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-11-12 20:40:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:38,751 INFO L225 Difference]: With dead ends: 445 [2018-11-12 20:40:38,751 INFO L226 Difference]: Without dead ends: 439 [2018-11-12 20:40:38,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:40:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-12 20:40:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 306. [2018-11-12 20:40:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-12 20:40:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 345 transitions. [2018-11-12 20:40:38,759 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 345 transitions. Word has length 150 [2018-11-12 20:40:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:38,760 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 345 transitions. [2018-11-12 20:40:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:40:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 345 transitions. [2018-11-12 20:40:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-12 20:40:38,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:38,762 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:38,762 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:38,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash -324892083, now seen corresponding path program 17 times [2018-11-12 20:40:38,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 2307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:39,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:39,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:39,725 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:39,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:39,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:39,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:39,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:39,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:39,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:40:39,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:39,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-12 20:40:40,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-12 20:40:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:41,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 12, 12] total 68 [2018-11-12 20:40:41,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:41,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-12 20:40:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-12 20:40:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:40:41,480 INFO L87 Difference]: Start difference. First operand 306 states and 345 transitions. Second operand 58 states. [2018-11-12 20:40:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:42,543 INFO L93 Difference]: Finished difference Result 587 states and 650 transitions. [2018-11-12 20:40:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-12 20:40:42,543 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2018-11-12 20:40:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:42,546 INFO L225 Difference]: With dead ends: 587 [2018-11-12 20:40:42,546 INFO L226 Difference]: Without dead ends: 565 [2018-11-12 20:40:42,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:40:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-12 20:40:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 365. [2018-11-12 20:40:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-12 20:40:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 412 transitions. [2018-11-12 20:40:42,556 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 412 transitions. Word has length 153 [2018-11-12 20:40:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:42,556 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 412 transitions. [2018-11-12 20:40:42,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-12 20:40:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 412 transitions. [2018-11-12 20:40:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-12 20:40:42,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:42,558 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:42,558 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:42,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 752334548, now seen corresponding path program 18 times [2018-11-12 20:40:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:44,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:44,316 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:44,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:44,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:44,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:44,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:44,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:44,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:44,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:48,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-12 20:40:48,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:48,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-12 20:40:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-12 20:40:48,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2018-11-12 20:40:48,221 INFO L87 Difference]: Start difference. First operand 365 states and 412 transitions. Second operand 59 states. [2018-11-12 20:40:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:49,382 INFO L93 Difference]: Finished difference Result 542 states and 598 transitions. [2018-11-12 20:40:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:40:49,386 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 180 [2018-11-12 20:40:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:49,389 INFO L225 Difference]: With dead ends: 542 [2018-11-12 20:40:49,389 INFO L226 Difference]: Without dead ends: 536 [2018-11-12 20:40:49,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2018-11-12 20:40:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-12 20:40:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 372. [2018-11-12 20:40:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-12 20:40:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 420 transitions. [2018-11-12 20:40:49,398 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 420 transitions. Word has length 180 [2018-11-12 20:40:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:49,399 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 420 transitions. [2018-11-12 20:40:49,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-12 20:40:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 420 transitions. [2018-11-12 20:40:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-12 20:40:49,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:49,401 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:49,401 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:49,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash -252635693, now seen corresponding path program 19 times [2018-11-12 20:40:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:49,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:49,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:51,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:51,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:51,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:51,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:51,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:51,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:51,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:51,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:54,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:54,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-12 20:40:54,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:54,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-12 20:40:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-12 20:40:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2018-11-12 20:40:54,682 INFO L87 Difference]: Start difference. First operand 372 states and 420 transitions. Second operand 60 states. [2018-11-12 20:40:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:56,072 INFO L93 Difference]: Finished difference Result 549 states and 606 transitions. [2018-11-12 20:40:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-12 20:40:56,073 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 183 [2018-11-12 20:40:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:56,076 INFO L225 Difference]: With dead ends: 549 [2018-11-12 20:40:56,076 INFO L226 Difference]: Without dead ends: 543 [2018-11-12 20:40:56,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2018-11-12 20:40:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-12 20:40:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2018-11-12 20:40:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 20:40:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 428 transitions. [2018-11-12 20:40:56,085 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 428 transitions. Word has length 183 [2018-11-12 20:40:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:56,086 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 428 transitions. [2018-11-12 20:40:56,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-12 20:40:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 428 transitions. [2018-11-12 20:40:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 20:40:56,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:56,088 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:56,088 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:56,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 895935092, now seen corresponding path program 20 times [2018-11-12 20:40:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 3636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:57,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:57,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:57,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:57,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:57,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:57,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:57,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:57,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:40:57,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:57,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-12 20:40:58,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-12 20:40:58,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:58,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 13, 13] total 81 [2018-11-12 20:40:58,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:58,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-12 20:40:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-12 20:40:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2936, Invalid=3544, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:40:58,789 INFO L87 Difference]: Start difference. First operand 379 states and 428 transitions. Second operand 70 states. [2018-11-12 20:41:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:01,779 INFO L93 Difference]: Finished difference Result 721 states and 797 transitions. [2018-11-12 20:41:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-12 20:41:01,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 186 [2018-11-12 20:41:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:01,784 INFO L225 Difference]: With dead ends: 721 [2018-11-12 20:41:01,784 INFO L226 Difference]: Without dead ends: 697 [2018-11-12 20:41:01,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2942, Invalid=3700, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:41:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-12 20:41:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 445. [2018-11-12 20:41:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-11-12 20:41:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 503 transitions. [2018-11-12 20:41:01,794 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 503 transitions. Word has length 186 [2018-11-12 20:41:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:01,794 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 503 transitions. [2018-11-12 20:41:01,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-12 20:41:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 503 transitions. [2018-11-12 20:41:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 20:41:01,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:01,796 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:01,796 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:01,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1102113070, now seen corresponding path program 21 times [2018-11-12 20:41:01,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:01,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:01,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:03,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:03,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:03,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:03,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:03,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:03,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:03,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:03,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:03,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:03,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:04,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:09,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:09,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-12 20:41:09,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-12 20:41:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-12 20:41:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2018-11-12 20:41:09,236 INFO L87 Difference]: Start difference. First operand 445 states and 503 transitions. Second operand 71 states. [2018-11-12 20:41:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:11,513 INFO L93 Difference]: Finished difference Result 656 states and 724 transitions. [2018-11-12 20:41:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:41:11,514 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 216 [2018-11-12 20:41:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:11,518 INFO L225 Difference]: With dead ends: 656 [2018-11-12 20:41:11,518 INFO L226 Difference]: Without dead ends: 650 [2018-11-12 20:41:11,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2018-11-12 20:41:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-12 20:41:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 452. [2018-11-12 20:41:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-12 20:41:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-11-12 20:41:11,529 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 216 [2018-11-12 20:41:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:11,530 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-11-12 20:41:11,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-12 20:41:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-11-12 20:41:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-12 20:41:11,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:11,532 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:11,532 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:11,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash -518064979, now seen corresponding path program 22 times [2018-11-12 20:41:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:11,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:11,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:13,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:13,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:13,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:13,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:13,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:13,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:13,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:13,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:13,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:13,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:19,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:19,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-12 20:41:19,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-12 20:41:19,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-12 20:41:19,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2018-11-12 20:41:19,415 INFO L87 Difference]: Start difference. First operand 452 states and 511 transitions. Second operand 72 states. [2018-11-12 20:41:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:21,748 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2018-11-12 20:41:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-12 20:41:21,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-11-12 20:41:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:21,753 INFO L225 Difference]: With dead ends: 663 [2018-11-12 20:41:21,753 INFO L226 Difference]: Without dead ends: 657 [2018-11-12 20:41:21,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2018-11-12 20:41:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-12 20:41:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 459. [2018-11-12 20:41:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-12 20:41:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 519 transitions. [2018-11-12 20:41:21,764 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 519 transitions. Word has length 219 [2018-11-12 20:41:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:21,764 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 519 transitions. [2018-11-12 20:41:21,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-12 20:41:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 519 transitions. [2018-11-12 20:41:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-12 20:41:21,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:21,766 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:21,767 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:21,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:21,767 INFO L82 PathProgramCache]: Analyzing trace with hash -399850290, now seen corresponding path program 23 times [2018-11-12 20:41:21,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:21,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:23,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:23,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:23,733 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:23,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:23,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:23,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:23,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:23,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:41:23,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:23,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-12 20:41:24,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-12 20:41:25,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:25,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 14, 14] total 95 [2018-11-12 20:41:25,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:25,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-11-12 20:41:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-11-12 20:41:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2018-11-12 20:41:25,123 INFO L87 Difference]: Start difference. First operand 459 states and 519 transitions. Second operand 83 states. [2018-11-12 20:41:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:27,568 INFO L93 Difference]: Finished difference Result 868 states and 958 transitions. [2018-11-12 20:41:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-12 20:41:27,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 222 [2018-11-12 20:41:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:27,573 INFO L225 Difference]: With dead ends: 868 [2018-11-12 20:41:27,573 INFO L226 Difference]: Without dead ends: 842 [2018-11-12 20:41:27,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:41:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-12 20:41:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 532. [2018-11-12 20:41:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-12 20:41:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 602 transitions. [2018-11-12 20:41:27,585 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 602 transitions. Word has length 222 [2018-11-12 20:41:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:27,586 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 602 transitions. [2018-11-12 20:41:27,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-11-12 20:41:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 602 transitions. [2018-11-12 20:41:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-12 20:41:27,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:27,588 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:27,588 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:27,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1768862701, now seen corresponding path program 24 times [2018-11-12 20:41:27,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:27,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:27,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:30,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:30,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:30,203 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:30,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:30,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:30,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:30,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:30,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:30,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:30,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:30,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:38,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:38,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 166 [2018-11-12 20:41:38,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-12 20:41:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-12 20:41:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2018-11-12 20:41:38,235 INFO L87 Difference]: Start difference. First operand 532 states and 602 transitions. Second operand 84 states. [2018-11-12 20:41:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:41,193 INFO L93 Difference]: Finished difference Result 780 states and 861 transitions. [2018-11-12 20:41:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-12 20:41:41,193 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 255 [2018-11-12 20:41:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:41,197 INFO L225 Difference]: With dead ends: 780 [2018-11-12 20:41:41,197 INFO L226 Difference]: Without dead ends: 774 [2018-11-12 20:41:41,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2018-11-12 20:41:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-12 20:41:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 539. [2018-11-12 20:41:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-12 20:41:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 610 transitions. [2018-11-12 20:41:41,209 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 610 transitions. Word has length 255 [2018-11-12 20:41:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:41,209 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 610 transitions. [2018-11-12 20:41:41,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-12 20:41:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 610 transitions. [2018-11-12 20:41:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-12 20:41:41,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:41,212 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:41,212 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:41,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash 412573620, now seen corresponding path program 25 times [2018-11-12 20:41:41,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:44,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:44,120 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:44,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:44,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:44,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:44,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:44,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:51,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 168 [2018-11-12 20:41:51,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:51,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-12 20:41:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-12 20:41:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2018-11-12 20:41:51,972 INFO L87 Difference]: Start difference. First operand 539 states and 610 transitions. Second operand 85 states. [2018-11-12 20:41:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:55,857 INFO L93 Difference]: Finished difference Result 787 states and 869 transitions. [2018-11-12 20:41:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-12 20:41:55,858 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 258 [2018-11-12 20:41:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:55,861 INFO L225 Difference]: With dead ends: 787 [2018-11-12 20:41:55,861 INFO L226 Difference]: Without dead ends: 781 [2018-11-12 20:41:55,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2018-11-12 20:41:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-11-12 20:41:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 546. [2018-11-12 20:41:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-12 20:41:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 618 transitions. [2018-11-12 20:41:55,872 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 618 transitions. Word has length 258 [2018-11-12 20:41:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 618 transitions. [2018-11-12 20:41:55,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-12 20:41:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 618 transitions. [2018-11-12 20:41:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-12 20:41:55,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:55,875 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:55,875 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:55,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 431856755, now seen corresponding path program 26 times [2018-11-12 20:41:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 7833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:59,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:59,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:59,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:59,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:59,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:59,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:59,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:59,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:59,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:41:59,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:59,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-12 20:42:01,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-12 20:42:02,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:02,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 15, 15] total 110 [2018-11-12 20:42:02,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:02,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-12 20:42:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-12 20:42:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2018-11-12 20:42:02,122 INFO L87 Difference]: Start difference. First operand 546 states and 618 transitions. Second operand 97 states. [2018-11-12 20:42:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:06,125 INFO L93 Difference]: Finished difference Result 1028 states and 1133 transitions. [2018-11-12 20:42:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-12 20:42:06,126 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 261 [2018-11-12 20:42:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:06,131 INFO L225 Difference]: With dead ends: 1028 [2018-11-12 20:42:06,131 INFO L226 Difference]: Without dead ends: 1000 [2018-11-12 20:42:06,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2018-11-12 20:42:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-11-12 20:42:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 626. [2018-11-12 20:42:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-12 20:42:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 709 transitions. [2018-11-12 20:42:06,141 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 709 transitions. Word has length 261 [2018-11-12 20:42:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:06,142 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 709 transitions. [2018-11-12 20:42:06,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-12 20:42:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 709 transitions. [2018-11-12 20:42:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-12 20:42:06,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:06,144 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:06,145 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:06,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1637142579, now seen corresponding path program 27 times [2018-11-12 20:42:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:06,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:06,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:09,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:09,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:09,882 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:09,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:09,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:09,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:09,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:09,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:09,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:09,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:10,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:20,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:20,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 194 [2018-11-12 20:42:20,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:20,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-12 20:42:20,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-12 20:42:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17965, Invalid=19477, Unknown=0, NotChecked=0, Total=37442 [2018-11-12 20:42:20,164 INFO L87 Difference]: Start difference. First operand 626 states and 709 transitions. Second operand 98 states. [2018-11-12 20:42:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:25,837 INFO L93 Difference]: Finished difference Result 914 states and 1009 transitions. [2018-11-12 20:42:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-12 20:42:25,837 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 297 [2018-11-12 20:42:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:25,842 INFO L225 Difference]: With dead ends: 914 [2018-11-12 20:42:25,842 INFO L226 Difference]: Without dead ends: 908 [2018-11-12 20:42:25,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=17971, Invalid=19859, Unknown=0, NotChecked=0, Total=37830 [2018-11-12 20:42:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-12 20:42:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 633. [2018-11-12 20:42:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-12 20:42:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 717 transitions. [2018-11-12 20:42:25,853 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 717 transitions. Word has length 297 [2018-11-12 20:42:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:25,854 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 717 transitions. [2018-11-12 20:42:25,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-12 20:42:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 717 transitions. [2018-11-12 20:42:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-12 20:42:25,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:25,856 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:25,857 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:25,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1112549934, now seen corresponding path program 28 times [2018-11-12 20:42:25,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:25,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:25,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:29,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:29,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:29,899 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:29,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:29,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:29,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:29,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:29,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:30,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:30,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 196 [2018-11-12 20:42:40,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:40,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-12 20:42:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-12 20:42:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18346, Invalid=19874, Unknown=0, NotChecked=0, Total=38220 [2018-11-12 20:42:40,517 INFO L87 Difference]: Start difference. First operand 633 states and 717 transitions. Second operand 99 states. [2018-11-12 20:42:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:45,897 INFO L93 Difference]: Finished difference Result 921 states and 1017 transitions. [2018-11-12 20:42:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-12 20:42:45,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 300 [2018-11-12 20:42:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:45,902 INFO L225 Difference]: With dead ends: 921 [2018-11-12 20:42:45,903 INFO L226 Difference]: Without dead ends: 915 [2018-11-12 20:42:45,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=18352, Invalid=20260, Unknown=0, NotChecked=0, Total=38612 [2018-11-12 20:42:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-12 20:42:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 640. [2018-11-12 20:42:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-12 20:42:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-11-12 20:42:45,914 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 300 [2018-11-12 20:42:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:45,914 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-11-12 20:42:45,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-12 20:42:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-11-12 20:42:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-12 20:42:45,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:45,917 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:45,918 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:45,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -709031891, now seen corresponding path program 29 times [2018-11-12 20:42:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:45,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:45,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 10908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:50,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:50,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:50,397 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:50,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:50,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:50,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:50,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:50,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:42:50,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:50,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-12 20:42:51,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-12 20:42:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 16, 16] total 126 [2018-11-12 20:42:52,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:52,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-11-12 20:42:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-11-12 20:42:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2018-11-12 20:42:52,673 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 112 states. [2018-11-12 20:42:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:57,798 INFO L93 Difference]: Finished difference Result 1201 states and 1322 transitions. [2018-11-12 20:42:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-11-12 20:42:57,799 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 303 [2018-11-12 20:42:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:57,804 INFO L225 Difference]: With dead ends: 1201 [2018-11-12 20:42:57,804 INFO L226 Difference]: Without dead ends: 1171 [2018-11-12 20:42:57,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 580 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2018-11-12 20:42:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-11-12 20:42:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 727. [2018-11-12 20:42:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-12 20:42:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 824 transitions. [2018-11-12 20:42:57,816 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 824 transitions. Word has length 303 [2018-11-12 20:42:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:57,816 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 824 transitions. [2018-11-12 20:42:57,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-11-12 20:42:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 824 transitions. [2018-11-12 20:42:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-12 20:42:57,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:57,819 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:57,820 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:57,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1992803276, now seen corresponding path program 30 times [2018-11-12 20:42:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:03,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:03,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:03,585 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:03,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:03,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:03,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:03,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:03,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:03,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:03,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:03,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:04,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 206 [2018-11-12 20:43:16,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:16,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-11-12 20:43:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-11-12 20:43:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-12 20:43:16,660 INFO L87 Difference]: Start difference. First operand 727 states and 824 transitions. Second operand 113 states. [2018-11-12 20:43:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:25,071 INFO L93 Difference]: Finished difference Result 893 states and 1003 transitions. [2018-11-12 20:43:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-11-12 20:43:25,072 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 342 [2018-11-12 20:43:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:25,076 INFO L225 Difference]: With dead ends: 893 [2018-11-12 20:43:25,076 INFO L226 Difference]: Without dead ends: 887 [2018-11-12 20:43:25,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 573 SyntacticMatches, 19 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-12 20:43:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-12 20:43:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 734. [2018-11-12 20:43:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-12 20:43:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 832 transitions. [2018-11-12 20:43:25,090 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 832 transitions. Word has length 342 [2018-11-12 20:43:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:25,090 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 832 transitions. [2018-11-12 20:43:25,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-11-12 20:43:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 832 transitions. [2018-11-12 20:43:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-12 20:43:25,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:25,094 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:25,094 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:25,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -294769805, now seen corresponding path program 31 times [2018-11-12 20:43:25,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:25,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:25,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:25,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:25,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:29,960 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:29,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:29,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:30,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:30,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:42,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:42,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 206 [2018-11-12 20:43:42,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:42,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-12 20:43:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-12 20:43:42,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-12 20:43:42,193 INFO L87 Difference]: Start difference. First operand 734 states and 832 transitions. Second operand 114 states. [2018-11-12 20:43:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:49,175 INFO L93 Difference]: Finished difference Result 867 states and 978 transitions. [2018-11-12 20:43:49,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-11-12 20:43:49,175 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 345 [2018-11-12 20:43:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:49,179 INFO L225 Difference]: With dead ends: 867 [2018-11-12 20:43:49,179 INFO L226 Difference]: Without dead ends: 861 [2018-11-12 20:43:49,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 578 SyntacticMatches, 21 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-12 20:43:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-12 20:43:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 741. [2018-11-12 20:43:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-12 20:43:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 840 transitions. [2018-11-12 20:43:49,191 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 840 transitions. Word has length 345 [2018-11-12 20:43:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:49,192 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 840 transitions. [2018-11-12 20:43:49,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-12 20:43:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 840 transitions. [2018-11-12 20:43:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-12 20:43:49,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:49,194 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:49,195 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash -304447532, now seen corresponding path program 32 times [2018-11-12 20:43:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:49,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 14787 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:54,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:54,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:54,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:54,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:54,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:54,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:54,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:54,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-12 20:43:54,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:54,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-12 20:43:55,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-12 20:43:57,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 17, 17] total 131 [2018-11-12 20:43:57,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:57,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-12 20:43:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-12 20:43:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8011, Invalid=9019, Unknown=0, NotChecked=0, Total=17030 [2018-11-12 20:43:57,171 INFO L87 Difference]: Start difference. First operand 741 states and 840 transitions. Second operand 116 states. Received shutdown request... [2018-11-12 20:44:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-12 20:44:03,368 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:44:03,374 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:44:03,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:44:03 BoogieIcfgContainer [2018-11-12 20:44:03,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:44:03,375 INFO L168 Benchmark]: Toolchain (without parser) took 242335.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 818.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.5 MB). Peak memory consumption was 549.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:03,377 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:03,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:03,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:03,378 INFO L168 Benchmark]: Boogie Preprocessor took 22.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:03,379 INFO L168 Benchmark]: RCFGBuilder took 441.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:03,379 INFO L168 Benchmark]: TraceAbstraction took 241533.42 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 81.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 508.4 MB). Peak memory consumption was 589.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:03,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 306.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 441.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241533.42 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 81.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 508.4 MB). Peak memory consumption was 589.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (741states) and FLOYD_HOARE automaton (currently 105 states, 116 states before enhancement),while ReachableStatesComputation was computing reachable states (720 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 241.4s OverallTime, 36 OverallIterations, 99 TraceHistogramMax, 70.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 13385 SDslu, 15000 SDs, 0 SdLazy, 10407 SolverSat, 4311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12671 GetRequests, 9564 SyntacticMatches, 72 SemanticMatches, 3035 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15500 ImplicationChecksByTransitivity, 161.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 4901 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 165.3s InterpolantComputationTime, 10931 NumberOfCodeBlocks, 9743 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 16268 ConstructedInterpolants, 0 QuantifiedInterpolants, 9423888 SizeOfPredicates, 78 NumberOfNonLiveVariables, 10115 ConjunctsInSsa, 1373 ConjunctsInUnsatCore, 102 InterpolantComputations, 3 PerfectInterpolantSequences, 92865/414984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown