java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:35:55,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:35:55,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:35:55,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:35:55,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:35:55,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:35:55,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:35:55,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:35:55,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:35:55,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:35:55,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:35:55,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:35:55,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:35:55,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:35:55,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:35:55,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:35:55,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:35:55,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:35:55,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:35:55,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:35:55,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:35:55,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:35:55,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:35:55,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:35:55,417 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:35:55,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:35:55,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:35:55,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:35:55,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:35:55,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:35:55,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:35:55,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:35:55,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:35:55,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:35:55,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:35:55,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:35:55,428 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:35:55,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:35:55,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:35:55,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:35:55,461 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:35:55,461 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:35:55,461 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:35:55,461 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:35:55,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:35:55,462 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:35:55,462 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:35:55,462 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:35:55,462 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:35:55,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:35:55,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:35:55,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:35:55,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:35:55,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:35:55,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:35:55,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:35:55,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:35:55,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:35:55,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:35:55,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:35:55,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:35:55,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:35:55,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:35:55,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:35:55,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:35:55,470 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:35:55,470 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:35:55,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:35:55,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:35:55,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:35:55,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:35:55,562 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:35:55,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i [2018-11-12 20:35:55,627 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad8b88443/cb5cf1e9afcd433aa9cce3857c4692d3/FLAG735e814bb [2018-11-12 20:35:56,110 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:35:56,111 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i [2018-11-12 20:35:56,118 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad8b88443/cb5cf1e9afcd433aa9cce3857c4692d3/FLAG735e814bb [2018-11-12 20:35:56,134 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad8b88443/cb5cf1e9afcd433aa9cce3857c4692d3 [2018-11-12 20:35:56,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:35:56,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:35:56,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:35:56,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:35:56,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:35:56,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c33c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56, skipping insertion in model container [2018-11-12 20:35:56,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:35:56,187 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:35:56,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:35:56,369 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:35:56,390 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:35:56,409 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:35:56,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56 WrapperNode [2018-11-12 20:35:56,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:35:56,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:35:56,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:35:56,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:35:56,421 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:35:56" (1/1) ... [2018-11-12 20:35:56,427 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:35:56" (1/1) ... [2018-11-12 20:35:56,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:35:56,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:35:56,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:35:56,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:35:56,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (1/1) ... [2018-11-12 20:35:56,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:35:56,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:35:56,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:35:56,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:35:56,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (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:35:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:35:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:35:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:35:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:35:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:35:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:35:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:35:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:35:56,781 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:35:56,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:35:56 BoogieIcfgContainer [2018-11-12 20:35:56,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:35:56,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:35:56,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:35:56,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:35:56,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:35:56" (1/3) ... [2018-11-12 20:35:56,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86e4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:35:56, skipping insertion in model container [2018-11-12 20:35:56,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:56" (2/3) ... [2018-11-12 20:35:56,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86e4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:35:56, skipping insertion in model container [2018-11-12 20:35:56,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:35:56" (3/3) ... [2018-11-12 20:35:56,790 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call1.i [2018-11-12 20:35:56,798 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:35:56,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:35:56,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:35:56,847 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:35:56,848 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:35:56,848 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:35:56,848 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:35:56,848 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:35:56,848 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:35:56,848 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:35:56,849 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:35:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-12 20:35:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:35:56,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:56,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:56,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:56,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-12 20:35:56,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:56,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:56,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:56,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:56,986 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:35:56,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:35:56,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:35:56,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:56,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:35:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:35:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:35:57,006 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-12 20:35:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:57,031 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-12 20:35:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:35:57,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:35:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:57,046 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:35:57,046 INFO L226 Difference]: Without dead ends: 12 [2018-11-12 20:35:57,051 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:35:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-12 20:35:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-12 20:35:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-12 20:35:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-12 20:35:57,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-12 20:35:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:57,089 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-12 20:35:57,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:35:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-12 20:35:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:35:57,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:57,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:57,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:57,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-12 20:35:57,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:57,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:57,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:57,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:57,297 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:35:57,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:35:57,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:35:57,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:57,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:35:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:35:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:35:57,302 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-12 20:35:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:57,355 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-12 20:35:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:35:57,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:35:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:57,359 INFO L225 Difference]: With dead ends: 19 [2018-11-12 20:35:57,359 INFO L226 Difference]: Without dead ends: 14 [2018-11-12 20:35:57,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:35:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-12 20:35:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-12 20:35:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-12 20:35:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-12 20:35:57,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-12 20:35:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-12 20:35:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:35:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-12 20:35:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:35:57,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:57,377 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:57,377 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:57,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-12 20:35:57,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:57,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:57,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:57,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:57,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:57,550 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-12 20:35:57,552 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-12 20:35:57,589 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:35:57,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:35:57,678 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:35:57,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:35:57,899 INFO L272 AbstractInterpreter]: Visited 12 different actions 53 times. Merged at 3 different actions 19 times. Widened at 1 different actions 3 times. Performed 118 root evaluator evaluations with a maximum evaluation depth of 6. Performed 118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:35:57,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:57,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:35:57,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:57,938 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:35:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:57,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:57,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:35:58,137 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:58,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:35:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:35:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:58,138 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-12 20:35:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:58,161 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-12 20:35:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:35:58,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-12 20:35:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:58,163 INFO L225 Difference]: With dead ends: 21 [2018-11-12 20:35:58,163 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:35:58,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:35:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:35:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:35:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-12 20:35:58,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-12 20:35:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:58,169 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-12 20:35:58,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:35:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-12 20:35:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:35:58,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:58,170 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:58,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:58,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-12 20:35:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:58,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:58,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:58,337 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:58,337 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:35:58,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:58,337 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:35:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:58,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:58,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:35:58,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:58,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 20:35:58,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:35:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:35:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:58,751 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-12 20:35:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:58,802 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-12 20:35:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:35:58,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-12 20:35:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:58,803 INFO L225 Difference]: With dead ends: 23 [2018-11-12 20:35:58,803 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:35:58,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:35:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:35:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:35:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-12 20:35:58,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-12 20:35:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:58,809 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-12 20:35:58,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:35:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-12 20:35:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:35:58,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:58,810 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:58,811 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:58,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-12 20:35:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:58,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:58,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:58,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:58,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:58,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:58,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:58,949 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:35:58,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:58,949 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:35:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:58,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:58,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:58,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:58,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:59,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:59,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:59,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-12 20:35:59,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:59,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:35:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:35:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:59,221 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-12 20:35:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:59,257 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-12 20:35:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:35:59,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:35:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:59,259 INFO L225 Difference]: With dead ends: 25 [2018-11-12 20:35:59,259 INFO L226 Difference]: Without dead ends: 20 [2018-11-12 20:35:59,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-12 20:35:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-12 20:35:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:35:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-12 20:35:59,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-12 20:35:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:59,265 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-12 20:35:59,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:35:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-12 20:35:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:35:59,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:59,267 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:59,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:59,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-12 20:35:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:59,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:59,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:59,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:59,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:59,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:59,393 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:59,393 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:35:59,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:59,394 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:35:59,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:59,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:59,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:59,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:59,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:59,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:35:59,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:59,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:35:59,995 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-12 20:36:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:00,049 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-12 20:36:00,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:36:00,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-12 20:36:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:00,051 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:36:00,051 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:36:00,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:36:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:36:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-12 20:36:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:36:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-12 20:36:00,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-12 20:36:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:00,057 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-12 20:36:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:36:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-12 20:36:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:36:00,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:00,058 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:00,058 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:00,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-12 20:36:00,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:00,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:00,277 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:00,278 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:36:00,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:00,278 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:36:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:00,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:36:00,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:36:00,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:00,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-12 20:36:00,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:36:00,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:36:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:36:00,504 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-12 20:36:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:00,563 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-12 20:36:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:36:00,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-12 20:36:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:00,567 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:36:00,567 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:36:00,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:36:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:36:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-12 20:36:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:36:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-12 20:36:00,572 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-12 20:36:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:00,572 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-12 20:36:00,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:36:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-12 20:36:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:36:00,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:00,574 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:00,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:00,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-12 20:36:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:00,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:00,794 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:00,794 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:36:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:00,794 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:36:00,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:36:00,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:36:00,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:36:00,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:01,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:01,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:36:01,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:36:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:36:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:36:01,176 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-12 20:36:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:01,250 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-12 20:36:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:36:01,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:36:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:01,254 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:36:01,254 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:36:01,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:36:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:36:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-12 20:36:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:36:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-12 20:36:01,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-12 20:36:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:01,260 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-12 20:36:01,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:36:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-12 20:36:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:36:01,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:01,262 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:01,262 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:01,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-12 20:36:01,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:01,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:01,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:01,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:01,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:01,514 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:01,514 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:36:01,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:01,514 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:36:01,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:01,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:01,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:01,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-12 20:36:01,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:36:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:36:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:36:01,874 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-12 20:36:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:01,985 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-12 20:36:01,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:36:01,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-12 20:36:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:01,990 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:36:01,990 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:36:01,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:36:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:36:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-12 20:36:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:36:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-12 20:36:01,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-12 20:36:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:01,996 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-12 20:36:01,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:36:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-12 20:36:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:36:01,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:01,997 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:01,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:01,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-12 20:36:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:01,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:01,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:02,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:02,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:02,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:02,189 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:36:02,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:02,189 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:36:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:02,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:36:04,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:36:04,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:04,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:04,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:04,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-12 20:36:04,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:04,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:36:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:36:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:36:04,385 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-12 20:36:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:04,478 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-12 20:36:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:36:04,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-12 20:36:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:04,480 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:36:04,480 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:36:04,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:36:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:36:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-12 20:36:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:36:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-12 20:36:04,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-12 20:36:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:04,486 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-12 20:36:04,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:36:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-12 20:36:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:36:04,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:04,488 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:04,489 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:04,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-12 20:36:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:04,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:04,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:04,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:04,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:04,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:04,659 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:04,659 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:36:04,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:04,659 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:36:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:36:04,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:36:04,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:36:04,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:04,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:04,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:04,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:36:04,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:04,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:36:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:36:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:36:04,987 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-12 20:36:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:05,148 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-12 20:36:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:36:05,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-12 20:36:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:05,151 INFO L225 Difference]: With dead ends: 37 [2018-11-12 20:36:05,151 INFO L226 Difference]: Without dead ends: 32 [2018-11-12 20:36:05,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:36:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-12 20:36:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-12 20:36:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:36:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-12 20:36:05,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-12 20:36:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:05,156 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-12 20:36:05,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:36:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-12 20:36:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:36:05,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:05,158 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:05,158 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:05,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-12 20:36:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:05,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:05,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:05,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:05,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:05,422 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:36:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:05,422 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:36:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:05,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:05,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:05,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:05,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:05,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:36:05,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:36:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:36:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:36:05,906 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-12 20:36:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:06,021 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:36:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:36:06,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-12 20:36:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:06,024 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:36:06,024 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:36:06,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:36:06,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:36:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-12 20:36:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-12 20:36:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-12 20:36:06,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-12 20:36:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:06,032 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-12 20:36:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:36:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-12 20:36:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-12 20:36:06,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:06,033 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:06,033 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-12 20:36:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:06,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:06,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:06,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:06,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:06,706 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:36:06,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:06,706 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:36:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:06,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:36:26,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:36:26,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:26,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:27,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 124 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:54,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:54,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:36:54,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:54,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:36:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:36:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=447, Unknown=10, NotChecked=0, Total=650 [2018-11-12 20:36:54,981 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-12 20:36:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:55,239 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-12 20:36:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:36:55,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-12 20:36:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:55,241 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:36:55,242 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:36:55,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=193, Invalid=447, Unknown=10, NotChecked=0, Total=650 [2018-11-12 20:36:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:36:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-12 20:36:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:36:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-12 20:36:55,247 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-12 20:36:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:55,247 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-12 20:36:55,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:36:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-12 20:36:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:36:55,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:55,248 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:55,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:55,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-12 20:36:55,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:55,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:55,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:55,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:55,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:55,543 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:55,543 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:36:55,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:55,543 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:36:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:36:55,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:36:55,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:36:55,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:55,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:55,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:56,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:56,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:36:56,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:56,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:36:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:36:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:36:56,152 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-12 20:36:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:56,338 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-12 20:36:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:36:56,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-12 20:36:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:56,340 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:36:56,340 INFO L226 Difference]: Without dead ends: 38 [2018-11-12 20:36:56,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:36:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-12 20:36:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-12 20:36:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:36:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-12 20:36:56,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-12 20:36:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:56,346 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-12 20:36:56,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:36:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-12 20:36:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:36:56,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:56,347 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:56,347 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:56,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-12 20:36:56,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:56,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:56,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:56,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:56,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:56,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:56,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:56,905 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:56,905 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:36:56,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:56,906 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:36:56,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:56,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:56,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:56,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:36:57,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:36:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:36:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:36:57,708 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-12 20:36:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:57,862 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:36:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:36:57,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-12 20:36:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:57,863 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:36:57,863 INFO L226 Difference]: Without dead ends: 40 [2018-11-12 20:36:57,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:36:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-12 20:36:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-12 20:36:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-12 20:36:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-12 20:36:57,870 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-12 20:36:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:57,870 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-12 20:36:57,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:36:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-12 20:36:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:36:57,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:57,871 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:57,871 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:57,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-12 20:36:57,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:57,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:59,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:59,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:59,292 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:59,292 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:36:59,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:59,293 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:36:59,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:59,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:37:17,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:37:17,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:17,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:17,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:18,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:18,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-12 20:37:18,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:18,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:37:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:37:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:37:18,418 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-12 20:37:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:18,601 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-12 20:37:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:37:18,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-12 20:37:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:18,603 INFO L225 Difference]: With dead ends: 47 [2018-11-12 20:37:18,603 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:37:18,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:37:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:37:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-12 20:37:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:37:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-12 20:37:18,609 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-12 20:37:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:18,610 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-12 20:37:18,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:37:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-12 20:37:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:37:18,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:18,611 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:18,611 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:18,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-12 20:37:18,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:18,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:18,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:18,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:18,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:18,993 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:18,993 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:37:18,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:18,993 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:37:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:37:19,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:37:19,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:37:19,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:19,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:19,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:37:19,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:19,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:37:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:37:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:37:19,637 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-12 20:37:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:19,842 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-12 20:37:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:37:19,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-12 20:37:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:19,844 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:37:19,844 INFO L226 Difference]: Without dead ends: 44 [2018-11-12 20:37:19,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:37:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-12 20:37:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-12 20:37:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:37:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-12 20:37:19,851 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-12 20:37:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:19,851 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-12 20:37:19,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:37:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-12 20:37:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:37:19,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:19,852 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:19,852 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:19,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-12 20:37:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:19,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:19,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:20,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:20,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:20,182 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:20,182 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:37:20,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:20,182 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:37:20,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:20,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:37:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:20,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:20,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:21,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:21,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:37:21,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:21,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:37:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:37:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:37:21,188 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-12 20:37:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:21,687 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:37:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:37:21,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-12 20:37:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:21,689 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:37:21,689 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:37:21,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:37:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:37:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-12 20:37:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-12 20:37:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-12 20:37:21,694 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-12 20:37:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:21,695 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-12 20:37:21,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:37:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-12 20:37:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:37:21,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:21,696 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:21,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:21,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-12 20:37:21,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:21,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:21,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:21,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:22,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:22,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:22,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:22,060 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:37:22,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:22,061 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:37:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:37:22,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:57,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:38:57,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:57,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:57,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:57,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-12 20:38:57,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:38:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:38:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:38:57,873 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2018-11-12 20:38:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:58,464 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-12 20:38:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:38:58,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-12 20:38:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:58,466 INFO L225 Difference]: With dead ends: 53 [2018-11-12 20:38:58,466 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:38:58,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:38:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:38:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-12 20:38:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:38:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-12 20:38:58,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-11-12 20:38:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:58,471 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-12 20:38:58,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:38:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-12 20:38:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:38:58,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:58,472 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:58,472 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 723901956, now seen corresponding path program 18 times [2018-11-12 20:38:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:58,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:58,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:58,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:58,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:58,822 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:38:58,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:58,822 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:38:58,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:58,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:58,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:58,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:58,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:58,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:59,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:59,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:38:59,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:59,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:38:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:38:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:38:59,842 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 21 states. [2018-11-12 20:39:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:00,140 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-12 20:39:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:39:00,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-12 20:39:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:00,141 INFO L225 Difference]: With dead ends: 55 [2018-11-12 20:39:00,141 INFO L226 Difference]: Without dead ends: 50 [2018-11-12 20:39:00,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:39:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-12 20:39:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-12 20:39:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-12 20:39:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-12 20:39:00,147 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-11-12 20:39:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:00,147 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-12 20:39:00,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:39:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-12 20:39:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:39:00,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:00,148 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:00,149 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 19 times [2018-11-12 20:39:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:00,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:00,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:00,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:00,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:00,745 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:00,745 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:39:00,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:00,745 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:39:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:00,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:00,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:00,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:02,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:02,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:39:02,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:02,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:39:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:39:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:39:02,082 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 22 states. [2018-11-12 20:39:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:02,567 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-12 20:39:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:39:02,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-12 20:39:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:02,568 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:39:02,568 INFO L226 Difference]: Without dead ends: 52 [2018-11-12 20:39:02,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:39:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-12 20:39:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-12 20:39:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-12 20:39:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-12 20:39:02,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-12 20:39:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:02,580 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-12 20:39:02,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:39:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-12 20:39:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:39:02,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:02,582 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:02,582 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:02,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 627265296, now seen corresponding path program 20 times [2018-11-12 20:39:02,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:02,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:02,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:02,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:02,943 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:02,943 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:39:02,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:02,943 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:39:02,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:02,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:03,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:39:03,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:03,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:03,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-12 20:40:39,052 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 20:40:39,253 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:39,253 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:40:39,258 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:40:39,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:40:39 BoogieIcfgContainer [2018-11-12 20:40:39,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:40:39,260 INFO L168 Benchmark]: Toolchain (without parser) took 283112.33 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:40:39,261 INFO L168 Benchmark]: CDTParser took 0.21 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:40:39,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.22 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:40:39,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.26 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:40:39,263 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:40:39,263 INFO L168 Benchmark]: RCFGBuilder took 324.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:39,264 INFO L168 Benchmark]: TraceAbstraction took 282475.84 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 321.9 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -325.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:40:39,268 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.21 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 261.22 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 22.26 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 24.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 324.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 282475.84 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 321.9 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -325.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 21,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. TIMEOUT Result, 282.4s OverallTime, 22 OverallIterations, 21 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 428 SDtfs, 0 SDslu, 4341 SDs, 0 SdLazy, 3290 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 972 SyntacticMatches, 40 SemanticMatches, 419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 135.4s SatisfiabilityAnalysisTime, 45.0s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1199 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 1729 ConstructedInterpolants, 0 QuantifiedInterpolants, 327913 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 0/7980 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown