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.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:04:39,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:04:39,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:04:39,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:04:39,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:04:39,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:04:39,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:04:39,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:04:39,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:04:39,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:04:39,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:04:39,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:04:39,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:04:39,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:04:39,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:04:39,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:04:39,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:04:39,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:04:39,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:04:39,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:04:39,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:04:39,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:04:39,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:04:39,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:04:39,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:04:39,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:04:39,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:04:39,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:04:39,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:04:39,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:04:39,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:04:39,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:04:39,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:04:39,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:04:39,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:04:39,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:04:39,421 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:04:39,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:04:39,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:04:39,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:04:39,451 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:04:39,451 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:04:39,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:04:39,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:04:39,452 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:04:39,452 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:04:39,452 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:04:39,452 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:04:39,453 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:04:39,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:04:39,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:04:39,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:04:39,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:04:39,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:04:39,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:04:39,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:04:39,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:04:39,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:04:39,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:04:39,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:04:39,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:04:39,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:04:39,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:04:39,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:04:39,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:04:39,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:04:39,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:04:39,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:04:39,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:04:39,457 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:04:39,457 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:04:39,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:04:39,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:04:39,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:04:39,531 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:04:39,531 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:04:39,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 05:04:39,605 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3411a5e1/cbfedcb466cb4f07b313b353676bacd4/FLAG6cc606de0 [2018-11-07 05:04:39,992 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:04:39,992 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 05:04:40,000 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3411a5e1/cbfedcb466cb4f07b313b353676bacd4/FLAG6cc606de0 [2018-11-07 05:04:40,015 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3411a5e1/cbfedcb466cb4f07b313b353676bacd4 [2018-11-07 05:04:40,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:04:40,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:04:40,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:40,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:04:40,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:04:40,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4ab46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40, skipping insertion in model container [2018-11-07 05:04:40,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:04:40,084 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:04:40,297 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:40,301 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:04:40,322 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:40,338 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:04:40,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40 WrapperNode [2018-11-07 05:04:40,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:40,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:40,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:04:40,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:04:40,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:40,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:04:40,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:04:40,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:04:40,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... [2018-11-07 05:04:40,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:04:40,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:04:40,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:04:40,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:04:40,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:04:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:04:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:04:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:04:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:04:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:04:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:04:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:04:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:04:40,927 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:04:40,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:40 BoogieIcfgContainer [2018-11-07 05:04:40,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:04:40,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:04:40,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:04:40,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:04:40,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:40" (1/3) ... [2018-11-07 05:04:40,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719864c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:40, skipping insertion in model container [2018-11-07 05:04:40,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:40" (2/3) ... [2018-11-07 05:04:40,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719864c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:40, skipping insertion in model container [2018-11-07 05:04:40,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:40" (3/3) ... [2018-11-07 05:04:40,936 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 05:04:40,947 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:04:40,968 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:04:40,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:04:41,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:04:41,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:04:41,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:04:41,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:04:41,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:04:41,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:04:41,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:04:41,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:04:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 05:04:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:04:41,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:41,050 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:41,053 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:41,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 62896836, now seen corresponding path program 1 times [2018-11-07 05:04:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:41,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:41,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:04:41,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:41,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:04:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:04:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:04:41,206 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 05:04:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:41,229 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-07 05:04:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:04:41,231 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-07 05:04:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:41,239 INFO L225 Difference]: With dead ends: 52 [2018-11-07 05:04:41,239 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 05:04:41,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:04:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 05:04:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 05:04:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 05:04:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-07 05:04:41,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-07 05:04:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:41,282 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-07 05:04:41,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:04:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-07 05:04:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:04:41,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:41,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:41,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:41,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash -111227420, now seen corresponding path program 1 times [2018-11-07 05:04:41,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:41,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:41,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:04:41,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:41,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:04:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:04:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:04:41,575 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-07 05:04:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:41,719 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 05:04:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:04:41,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 05:04:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:41,721 INFO L225 Difference]: With dead ends: 35 [2018-11-07 05:04:41,722 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 05:04:41,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:04:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 05:04:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 05:04:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 05:04:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-07 05:04:41,732 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 20 [2018-11-07 05:04:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:41,732 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-07 05:04:41,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:04:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-07 05:04:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:04:41,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:41,734 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:41,734 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:41,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1352658359, now seen corresponding path program 1 times [2018-11-07 05:04:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:41,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:41,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:41,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:04:41,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:41,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:04:41,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:04:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:04:41,853 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-07 05:04:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:42,161 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-07 05:04:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:04:42,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 05:04:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:42,165 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:04:42,165 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 05:04:42,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 05:04:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 05:04:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-07 05:04:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 05:04:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 05:04:42,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2018-11-07 05:04:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:42,183 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 05:04:42,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:04:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 05:04:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:04:42,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:42,185 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:42,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:42,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash -38707475, now seen corresponding path program 1 times [2018-11-07 05:04:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:42,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:42,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:42,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:42,446 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 05:04:42,448 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [13], [21], [25], [29], [31], [34], [36], [40], [44], [50], [52], [57], [63], [66], [68], [71], [73], [74], [75], [76], [78], [79] [2018-11-07 05:04:42,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:04:42,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:04:43,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:04:43,138 INFO L272 AbstractInterpreter]: Visited 26 different actions 215 times. Merged at 10 different actions 103 times. Widened at 3 different actions 14 times. Found 7 fixpoints after 2 different actions. Largest state had 9 variables. [2018-11-07 05:04:43,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:43,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:04:43,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:43,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:43,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:43,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:43,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:43,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:43,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2018-11-07 05:04:43,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:43,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:04:43,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:04:43,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:04:43,660 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-11-07 05:04:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:44,334 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-07 05:04:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:04:44,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 05:04:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:44,337 INFO L225 Difference]: With dead ends: 72 [2018-11-07 05:04:44,338 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 05:04:44,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:04:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 05:04:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-07 05:04:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 05:04:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 05:04:44,348 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2018-11-07 05:04:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:44,348 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 05:04:44,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:04:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 05:04:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 05:04:44,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:44,351 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:44,351 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1515908604, now seen corresponding path program 2 times [2018-11-07 05:04:44,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:44,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:44,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 05:04:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:44,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:44,504 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:44,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:44,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:44,522 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:44,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:04:44,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 05:04:44,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 05:04:44,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2018-11-07 05:04:44,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:04:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:04:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:04:44,933 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 14 states. [2018-11-07 05:04:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:45,593 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-07 05:04:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:04:45,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 05:04:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:45,597 INFO L225 Difference]: With dead ends: 92 [2018-11-07 05:04:45,597 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:04:45,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:04:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-07 05:04:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 05:04:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-07 05:04:45,608 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 44 [2018-11-07 05:04:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:45,609 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-07 05:04:45,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:04:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-07 05:04:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 05:04:45,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:45,610 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:45,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:45,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash 775099085, now seen corresponding path program 3 times [2018-11-07 05:04:45,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:45,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:45,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:45,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:45,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:45,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:45,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:45,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:45,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:45,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:45,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:45,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:45,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:45,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:45,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:46,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:46,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2018-11-07 05:04:46,127 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:46,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:04:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:04:46,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:04:46,129 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 14 states. [2018-11-07 05:04:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:46,336 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-11-07 05:04:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:04:46,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-07 05:04:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:46,339 INFO L225 Difference]: With dead ends: 103 [2018-11-07 05:04:46,339 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 05:04:46,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:04:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 05:04:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2018-11-07 05:04:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 05:04:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-07 05:04:46,349 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 56 [2018-11-07 05:04:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:46,350 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-07 05:04:46,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:04:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-07 05:04:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 05:04:46,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:46,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:46,352 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:46,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash -916783191, now seen corresponding path program 4 times [2018-11-07 05:04:46,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:46,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:46,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 05:04:46,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:46,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:46,546 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:46,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:46,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:46,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:46,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:46,555 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:46,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:46,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:46,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:46,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2018-11-07 05:04:46,769 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:46,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:04:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:04:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:04:46,773 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-11-07 05:04:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:46,931 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-07 05:04:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:04:46,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-07 05:04:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:46,933 INFO L225 Difference]: With dead ends: 72 [2018-11-07 05:04:46,934 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:04:46,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:04:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:04:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-07 05:04:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 05:04:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-07 05:04:46,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2018-11-07 05:04:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-07 05:04:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:04:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-07 05:04:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:04:46,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:46,946 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:46,946 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:46,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 928258569, now seen corresponding path program 5 times [2018-11-07 05:04:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:46,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:47,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:47,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:47,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:47,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:47,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:47,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:47,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:47,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:47,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 05:04:47,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:47,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:47,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:47,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:47,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-07 05:04:47,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:47,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:04:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:04:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:04:47,676 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 19 states. [2018-11-07 05:04:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:48,058 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2018-11-07 05:04:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:04:48,061 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-11-07 05:04:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:48,062 INFO L225 Difference]: With dead ends: 135 [2018-11-07 05:04:48,062 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 05:04:48,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 05:04:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2018-11-07 05:04:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 05:04:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-11-07 05:04:48,073 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 77 [2018-11-07 05:04:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:48,073 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-11-07 05:04:48,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:04:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-07 05:04:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 05:04:48,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:48,076 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:48,076 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash -846983507, now seen corresponding path program 6 times [2018-11-07 05:04:48,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:48,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:48,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:48,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:48,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:48,329 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:48,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:48,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:48,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:48,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:48,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:48,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:48,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:48,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:48,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:48,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:48,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2018-11-07 05:04:48,895 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:48,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:04:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:04:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:04:48,896 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 20 states. [2018-11-07 05:04:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:49,322 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2018-11-07 05:04:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:04:49,322 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-07 05:04:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:49,324 INFO L225 Difference]: With dead ends: 141 [2018-11-07 05:04:49,324 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 05:04:49,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 05:04:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2018-11-07 05:04:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 05:04:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-07 05:04:49,335 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 80 [2018-11-07 05:04:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:49,336 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-07 05:04:49,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:04:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-07 05:04:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 05:04:49,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:49,338 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:49,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:49,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1143613321, now seen corresponding path program 7 times [2018-11-07 05:04:49,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:49,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:49,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:49,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 72 proven. 78 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 05:04:49,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:49,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:49,546 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:49,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:49,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:49,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:49,556 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:49,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:49,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:04:49,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:49,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2018-11-07 05:04:49,988 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:49,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:04:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:04:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:04:49,989 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 14 states. [2018-11-07 05:04:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:50,168 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-07 05:04:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:04:50,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-07 05:04:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:50,170 INFO L225 Difference]: With dead ends: 90 [2018-11-07 05:04:50,171 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 05:04:50,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:04:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 05:04:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-07 05:04:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 05:04:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-07 05:04:50,188 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 83 [2018-11-07 05:04:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:50,189 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-07 05:04:50,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:04:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-07 05:04:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 05:04:50,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:50,191 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:50,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:50,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash 643631593, now seen corresponding path program 8 times [2018-11-07 05:04:50,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:50,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:50,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:50,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:50,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:50,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:50,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:50,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:50,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:51,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 05:04:51,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:51,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:51,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:51,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:51,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-07 05:04:51,562 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:51,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:04:51,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:04:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-07 05:04:51,563 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 25 states. [2018-11-07 05:04:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:51,938 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-11-07 05:04:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:04:51,938 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2018-11-07 05:04:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:51,940 INFO L225 Difference]: With dead ends: 175 [2018-11-07 05:04:51,940 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 05:04:51,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:04:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 05:04:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 91. [2018-11-07 05:04:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 05:04:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-11-07 05:04:51,949 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 101 [2018-11-07 05:04:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:51,949 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-11-07 05:04:51,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:04:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-11-07 05:04:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 05:04:51,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:51,951 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:51,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:51,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1746775411, now seen corresponding path program 9 times [2018-11-07 05:04:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:51,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:51,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:52,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:52,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:52,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:52,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:52,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:52,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:52,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:52,206 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:52,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:52,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:52,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:52,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:52,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2018-11-07 05:04:52,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 05:04:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 05:04:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:52,643 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 26 states. [2018-11-07 05:04:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:53,096 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2018-11-07 05:04:53,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:04:53,096 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-11-07 05:04:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:53,098 INFO L225 Difference]: With dead ends: 181 [2018-11-07 05:04:53,098 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 05:04:53,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 186 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:04:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 05:04:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2018-11-07 05:04:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 05:04:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-11-07 05:04:53,107 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 104 [2018-11-07 05:04:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:53,107 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-11-07 05:04:53,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 05:04:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-11-07 05:04:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:04:53,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:53,109 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:53,109 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:53,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash 490903401, now seen corresponding path program 10 times [2018-11-07 05:04:53,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:53,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:53,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 121 proven. 145 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 05:04:53,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:53,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:53,543 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:53,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:53,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:53,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:53,554 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:53,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:53,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 05:04:53,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:53,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 17 [2018-11-07 05:04:53,849 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:53,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:04:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:04:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:04:53,850 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 16 states. [2018-11-07 05:04:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:54,035 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-07 05:04:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:04:54,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2018-11-07 05:04:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:54,038 INFO L225 Difference]: With dead ends: 110 [2018-11-07 05:04:54,038 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 05:04:54,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 206 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:04:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 05:04:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-07 05:04:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 05:04:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-11-07 05:04:54,048 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 107 [2018-11-07 05:04:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:54,048 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-11-07 05:04:54,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:04:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-11-07 05:04:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 05:04:54,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:54,050 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:54,051 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:54,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1091747383, now seen corresponding path program 11 times [2018-11-07 05:04:54,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:54,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:54,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:54,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:54,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:54,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:54,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:54,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:54,394 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:54,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 05:04:54,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:54,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:54,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:54,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:54,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-07 05:04:54,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:54,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 05:04:54,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 05:04:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:04:54,929 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 31 states. [2018-11-07 05:04:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:55,321 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-11-07 05:04:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:04:55,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2018-11-07 05:04:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:55,325 INFO L225 Difference]: With dead ends: 215 [2018-11-07 05:04:55,325 INFO L226 Difference]: Without dead ends: 156 [2018-11-07 05:04:55,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 223 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:04:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-07 05:04:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 111. [2018-11-07 05:04:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 05:04:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-07 05:04:55,335 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 125 [2018-11-07 05:04:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:55,335 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-07 05:04:55,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 05:04:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-07 05:04:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 05:04:55,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:55,337 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:55,337 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:55,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1980489325, now seen corresponding path program 12 times [2018-11-07 05:04:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:55,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:55,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:55,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:55,768 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:55,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:55,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:55,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:55,777 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:55,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:55,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:55,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:56,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:56,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:56,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 32 [2018-11-07 05:04:56,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:56,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 05:04:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 05:04:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:04:56,268 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 32 states. [2018-11-07 05:04:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:56,848 INFO L93 Difference]: Finished difference Result 221 states and 259 transitions. [2018-11-07 05:04:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:04:56,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2018-11-07 05:04:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:56,850 INFO L225 Difference]: With dead ends: 221 [2018-11-07 05:04:56,850 INFO L226 Difference]: Without dead ends: 164 [2018-11-07 05:04:56,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 228 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:04:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-07 05:04:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-11-07 05:04:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 05:04:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-07 05:04:56,860 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 128 [2018-11-07 05:04:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:56,861 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-07 05:04:56,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 05:04:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-07 05:04:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 05:04:56,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:56,862 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:56,862 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:56,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1231179593, now seen corresponding path program 13 times [2018-11-07 05:04:56,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:56,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:56,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 182 proven. 232 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 05:04:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:57,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:57,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:57,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:57,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:57,138 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:57,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:57,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 05:04:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 19 [2018-11-07 05:04:57,430 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:04:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:04:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:04:57,431 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 18 states. [2018-11-07 05:04:57,705 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 05:04:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:57,821 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-07 05:04:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:04:57,821 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-11-07 05:04:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:57,825 INFO L225 Difference]: With dead ends: 130 [2018-11-07 05:04:57,825 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 05:04:57,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 252 SyntacticMatches, 19 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:04:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 05:04:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-07 05:04:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 05:04:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-11-07 05:04:57,834 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 131 [2018-11-07 05:04:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:57,835 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-11-07 05:04:57,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:04:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-07 05:04:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 05:04:57,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:57,839 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:57,839 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:57,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2109554263, now seen corresponding path program 14 times [2018-11-07 05:04:57,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:57,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:57,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:57,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:04:58,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:58,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:58,407 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:58,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:58,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:58,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:58,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:58,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 05:04:58,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:58,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:04:59,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:04:59,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:59,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-07 05:04:59,430 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:59,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 05:04:59,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 05:04:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 05:04:59,431 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 37 states. [2018-11-07 05:05:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:00,430 INFO L93 Difference]: Finished difference Result 255 states and 297 transitions. [2018-11-07 05:05:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 05:05:00,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-11-07 05:05:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:00,432 INFO L225 Difference]: With dead ends: 255 [2018-11-07 05:05:00,432 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 05:05:00,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 265 SyntacticMatches, 20 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:05:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 05:05:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 131. [2018-11-07 05:05:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 05:05:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-07 05:05:00,442 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 149 [2018-11-07 05:05:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:00,443 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-07 05:05:00,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 05:05:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-07 05:05:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 05:05:00,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:00,444 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:00,444 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:00,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1564389965, now seen corresponding path program 15 times [2018-11-07 05:05:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:00,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:00,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:00,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:05:00,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:00,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:00,987 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:00,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:00,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:00,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:00,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:00,996 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:01,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:01,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:01,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:05:01,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:05:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:01,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 38 [2018-11-07 05:05:01,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:01,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 05:05:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 05:05:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:05:01,679 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 38 states. [2018-11-07 05:05:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:02,230 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2018-11-07 05:05:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 05:05:02,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 152 [2018-11-07 05:05:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:02,233 INFO L225 Difference]: With dead ends: 261 [2018-11-07 05:05:02,233 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 05:05:02,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 270 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:05:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 05:05:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 134. [2018-11-07 05:05:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-07 05:05:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-07 05:05:02,244 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 152 [2018-11-07 05:05:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:02,244 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-07 05:05:02,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 05:05:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-07 05:05:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 05:05:02,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:02,246 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:02,246 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:02,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -909684951, now seen corresponding path program 16 times [2018-11-07 05:05:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:02,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:02,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 255 proven. 339 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 05:05:02,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:02,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:02,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:02,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:02,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:02,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:02,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:02,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:05:02,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 05:05:02,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:02,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 21 [2018-11-07 05:05:02,807 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:02,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:05:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:05:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:05:02,808 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 20 states. [2018-11-07 05:05:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:03,163 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-07 05:05:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:05:03,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2018-11-07 05:05:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:03,166 INFO L225 Difference]: With dead ends: 150 [2018-11-07 05:05:03,166 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 05:05:03,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 298 SyntacticMatches, 23 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:05:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 05:05:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-07 05:05:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-07 05:05:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-11-07 05:05:03,177 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 155 [2018-11-07 05:05:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:03,177 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-07 05:05:03,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:05:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-11-07 05:05:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 05:05:03,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:03,179 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:03,179 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:03,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash -568620663, now seen corresponding path program 17 times [2018-11-07 05:05:03,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:03,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:03,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:03,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:03,181 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:03,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:03,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:03,761 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:03,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:03,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:03,762 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:03,770 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:03,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 05:05:03,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:03,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:04,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:04,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-07 05:05:04,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:04,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 05:05:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 05:05:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1487, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:05:04,808 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 43 states. [2018-11-07 05:05:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:06,485 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2018-11-07 05:05:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 05:05:06,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-11-07 05:05:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:06,487 INFO L225 Difference]: With dead ends: 295 [2018-11-07 05:05:06,487 INFO L226 Difference]: Without dead ends: 216 [2018-11-07 05:05:06,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 307 SyntacticMatches, 24 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:05:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-07 05:05:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2018-11-07 05:05:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-07 05:05:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-07 05:05:06,499 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 173 [2018-11-07 05:05:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:06,499 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-07 05:05:06,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 05:05:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-11-07 05:05:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 05:05:06,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:06,501 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:06,501 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:06,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 792251949, now seen corresponding path program 18 times [2018-11-07 05:05:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:06,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:06,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:07,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:07,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:07,490 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:07,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:07,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:07,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:07,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:07,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:07,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:07,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:07,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:08,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:08,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 44 [2018-11-07 05:05:08,229 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:08,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 05:05:08,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 05:05:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:05:08,231 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 44 states. [2018-11-07 05:05:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:09,162 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2018-11-07 05:05:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 05:05:09,162 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2018-11-07 05:05:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:09,164 INFO L225 Difference]: With dead ends: 301 [2018-11-07 05:05:09,164 INFO L226 Difference]: Without dead ends: 224 [2018-11-07 05:05:09,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 312 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=897, Invalid=2409, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:05:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-07 05:05:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 154. [2018-11-07 05:05:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 05:05:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-07 05:05:09,176 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 176 [2018-11-07 05:05:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:09,176 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-07 05:05:09,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 05:05:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-07 05:05:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 05:05:09,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:09,178 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:09,178 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:09,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1943038199, now seen corresponding path program 19 times [2018-11-07 05:05:09,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:09,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:09,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 340 proven. 466 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 05:05:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:09,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:09,755 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:09,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:09,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:09,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:09,765 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:09,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:09,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 05:05:10,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:10,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 23 [2018-11-07 05:05:10,289 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:10,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 05:05:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 05:05:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:05:10,290 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 22 states. [2018-11-07 05:05:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:10,528 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-07 05:05:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:05:10,531 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-07 05:05:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:10,532 INFO L225 Difference]: With dead ends: 170 [2018-11-07 05:05:10,533 INFO L226 Difference]: Without dead ends: 168 [2018-11-07 05:05:10,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 344 SyntacticMatches, 27 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-07 05:05:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-07 05:05:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-07 05:05:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 05:05:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-11-07 05:05:10,543 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 179 [2018-11-07 05:05:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:10,544 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-11-07 05:05:10,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 05:05:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-11-07 05:05:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 05:05:10,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:10,546 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:10,546 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:10,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash 213227881, now seen corresponding path program 20 times [2018-11-07 05:05:10,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:10,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:11,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:11,315 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:11,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:11,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:11,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:11,325 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:11,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 05:05:11,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:11,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:12,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:12,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-11-07 05:05:12,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:05:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:05:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1923, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 05:05:12,645 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 49 states. [2018-11-07 05:05:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:14,571 INFO L93 Difference]: Finished difference Result 335 states and 391 transitions. [2018-11-07 05:05:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 05:05:14,572 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 197 [2018-11-07 05:05:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:14,574 INFO L225 Difference]: With dead ends: 335 [2018-11-07 05:05:14,575 INFO L226 Difference]: Without dead ends: 246 [2018-11-07 05:05:14,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 349 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1152, Invalid=3138, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:05:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-07 05:05:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 171. [2018-11-07 05:05:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 05:05:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-11-07 05:05:14,590 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 197 [2018-11-07 05:05:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-11-07 05:05:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:05:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-11-07 05:05:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 05:05:14,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:14,592 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:14,595 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:14,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1707593203, now seen corresponding path program 21 times [2018-11-07 05:05:14,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:14,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:14,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:15,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:15,086 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:15,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:15,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:15,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:15,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:15,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:15,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:15,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:16,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:16,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 50 [2018-11-07 05:05:16,748 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:05:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:05:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:05:16,750 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 50 states. [2018-11-07 05:05:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:18,779 INFO L93 Difference]: Finished difference Result 341 states and 400 transitions. [2018-11-07 05:05:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 05:05:18,780 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 200 [2018-11-07 05:05:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:18,782 INFO L225 Difference]: With dead ends: 341 [2018-11-07 05:05:18,782 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 05:05:18,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 354 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:05:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 05:05:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-07 05:05:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 05:05:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-11-07 05:05:18,795 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 200 [2018-11-07 05:05:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:18,796 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-11-07 05:05:18,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:05:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-11-07 05:05:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 05:05:18,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:18,797 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:18,797 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:18,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:18,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1255745257, now seen corresponding path program 22 times [2018-11-07 05:05:18,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:18,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:18,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 437 proven. 613 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 05:05:19,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:19,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:19,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:19,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:19,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:19,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:19,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:19,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:19,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:19,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 05:05:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 25 [2018-11-07 05:05:20,055 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:20,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 05:05:20,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 05:05:20,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-07 05:05:20,056 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 24 states. [2018-11-07 05:05:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:20,580 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2018-11-07 05:05:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 05:05:20,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2018-11-07 05:05:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:20,585 INFO L225 Difference]: With dead ends: 190 [2018-11-07 05:05:20,585 INFO L226 Difference]: Without dead ends: 188 [2018-11-07 05:05:20,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 390 SyntacticMatches, 31 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-07 05:05:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-07 05:05:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-11-07 05:05:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 05:05:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-11-07 05:05:20,598 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 203 [2018-11-07 05:05:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-11-07 05:05:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 05:05:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-11-07 05:05:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 05:05:20,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:20,600 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:20,600 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -187764407, now seen corresponding path program 23 times [2018-11-07 05:05:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:20,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:20,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:21,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:21,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:21,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:21,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:21,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:21,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:21,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:21,845 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:21,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 05:05:21,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:21,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:23,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:24,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:24,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-11-07 05:05:24,154 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:24,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 05:05:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 05:05:24,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=2415, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 05:05:24,156 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 55 states. [2018-11-07 05:05:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:25,443 INFO L93 Difference]: Finished difference Result 375 states and 438 transitions. [2018-11-07 05:05:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 05:05:25,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 221 [2018-11-07 05:05:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:25,450 INFO L225 Difference]: With dead ends: 375 [2018-11-07 05:05:25,450 INFO L226 Difference]: Without dead ends: 276 [2018-11-07 05:05:25,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 391 SyntacticMatches, 32 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:05:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-07 05:05:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-11-07 05:05:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 05:05:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-11-07 05:05:25,468 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 221 [2018-11-07 05:05:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:25,468 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-11-07 05:05:25,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 05:05:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-11-07 05:05:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 05:05:25,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:25,471 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:25,471 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:25,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash -117776915, now seen corresponding path program 24 times [2018-11-07 05:05:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:25,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:25,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:26,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:26,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:26,084 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:26,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:26,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:26,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:26,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:26,095 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:26,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:26,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:26,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:27,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 56 [2018-11-07 05:05:27,505 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:27,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 05:05:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 05:05:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 05:05:27,507 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 56 states. [2018-11-07 05:05:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:28,681 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-11-07 05:05:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 05:05:28,681 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 224 [2018-11-07 05:05:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:28,683 INFO L225 Difference]: With dead ends: 381 [2018-11-07 05:05:28,683 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 05:05:28,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 396 SyntacticMatches, 35 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1441, Invalid=3961, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:05:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 05:05:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2018-11-07 05:05:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 05:05:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-11-07 05:05:28,697 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 224 [2018-11-07 05:05:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:28,698 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-11-07 05:05:28,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 05:05:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-11-07 05:05:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 05:05:28,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:28,699 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:28,700 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:28,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1820458697, now seen corresponding path program 25 times [2018-11-07 05:05:28,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:28,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:28,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:28,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:28,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 546 proven. 780 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 05:05:29,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:29,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:29,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:29,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:29,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:29,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:29,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:29,131 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:29,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:29,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 05:05:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:29,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 27 [2018-11-07 05:05:29,720 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:29,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 05:05:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 05:05:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-07 05:05:29,721 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 26 states. [2018-11-07 05:05:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:29,976 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-11-07 05:05:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:05:29,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 227 [2018-11-07 05:05:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:29,979 INFO L225 Difference]: With dead ends: 210 [2018-11-07 05:05:29,979 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 05:05:29,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 35 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:05:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 05:05:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-11-07 05:05:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-07 05:05:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-11-07 05:05:29,993 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 227 [2018-11-07 05:05:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-11-07 05:05:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 05:05:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-11-07 05:05:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 05:05:29,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:29,995 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:29,996 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:29,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash 161845545, now seen corresponding path program 26 times [2018-11-07 05:05:29,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:29,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:31,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:31,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:31,085 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:31,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:31,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:31,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:31,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:31,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 05:05:31,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:31,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:32,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:32,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-11-07 05:05:32,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:32,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 05:05:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 05:05:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=2963, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 05:05:32,772 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 61 states. [2018-11-07 05:05:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:33,674 INFO L93 Difference]: Finished difference Result 415 states and 485 transitions. [2018-11-07 05:05:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 05:05:33,674 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 245 [2018-11-07 05:05:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:33,676 INFO L225 Difference]: With dead ends: 415 [2018-11-07 05:05:33,676 INFO L226 Difference]: Without dead ends: 306 [2018-11-07 05:05:33,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 433 SyntacticMatches, 36 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:05:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-07 05:05:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2018-11-07 05:05:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-07 05:05:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-11-07 05:05:33,692 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 245 [2018-11-07 05:05:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:33,692 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-11-07 05:05:33,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 05:05:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-11-07 05:05:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 05:05:33,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:33,694 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:33,694 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:33,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash 851366349, now seen corresponding path program 27 times [2018-11-07 05:05:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:33,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:33,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:34,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:34,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:34,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:34,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:34,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:34,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:34,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:34,567 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:34,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:34,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:34,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:35,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:36,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 62 [2018-11-07 05:05:36,192 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:36,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 05:05:36,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 05:05:36,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2881, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 05:05:36,193 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 62 states. [2018-11-07 05:05:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:37,469 INFO L93 Difference]: Finished difference Result 421 states and 494 transitions. [2018-11-07 05:05:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 05:05:37,469 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 248 [2018-11-07 05:05:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:37,471 INFO L225 Difference]: With dead ends: 421 [2018-11-07 05:05:37,472 INFO L226 Difference]: Without dead ends: 314 [2018-11-07 05:05:37,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 438 SyntacticMatches, 39 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1761, Invalid=4881, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:05:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-07 05:05:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 214. [2018-11-07 05:05:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 05:05:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-11-07 05:05:37,485 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 248 [2018-11-07 05:05:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:37,485 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-11-07 05:05:37,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 05:05:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-11-07 05:05:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-07 05:05:37,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:37,487 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:37,487 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:37,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash -462938455, now seen corresponding path program 28 times [2018-11-07 05:05:37,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:37,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:37,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 667 proven. 967 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 05:05:37,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:37,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:37,964 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:37,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:37,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:37,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:37,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:38,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:38,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 05:05:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 29 [2018-11-07 05:05:38,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:38,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 05:05:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 05:05:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:05:38,779 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 28 states. [2018-11-07 05:05:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:39,090 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2018-11-07 05:05:39,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 05:05:39,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 251 [2018-11-07 05:05:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:39,092 INFO L225 Difference]: With dead ends: 230 [2018-11-07 05:05:39,093 INFO L226 Difference]: Without dead ends: 228 [2018-11-07 05:05:39,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 482 SyntacticMatches, 39 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:05:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-07 05:05:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-11-07 05:05:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-07 05:05:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 242 transitions. [2018-11-07 05:05:39,108 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 242 transitions. Word has length 251 [2018-11-07 05:05:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:39,108 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 242 transitions. [2018-11-07 05:05:39,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 05:05:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 242 transitions. [2018-11-07 05:05:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 05:05:39,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:39,110 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:39,110 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:39,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash 720861449, now seen corresponding path program 29 times [2018-11-07 05:05:39,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:39,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:40,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:40,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:40,431 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:40,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:40,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:40,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:40,441 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:40,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 05:05:40,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:40,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:41,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:42,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-11-07 05:05:42,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:42,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 05:05:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 05:05:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=3567, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 05:05:42,427 INFO L87 Difference]: Start difference. First operand 228 states and 242 transitions. Second operand 67 states. [2018-11-07 05:05:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:43,642 INFO L93 Difference]: Finished difference Result 455 states and 532 transitions. [2018-11-07 05:05:43,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 05:05:43,642 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 269 [2018-11-07 05:05:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:43,644 INFO L225 Difference]: With dead ends: 455 [2018-11-07 05:05:43,644 INFO L226 Difference]: Without dead ends: 336 [2018-11-07 05:05:43,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 475 SyntacticMatches, 40 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2112, Invalid=5898, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:05:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-07 05:05:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 231. [2018-11-07 05:05:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 05:05:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 245 transitions. [2018-11-07 05:05:43,662 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 245 transitions. Word has length 269 [2018-11-07 05:05:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:43,662 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 245 transitions. [2018-11-07 05:05:43,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 05:05:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 245 transitions. [2018-11-07 05:05:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-07 05:05:43,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:43,664 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:43,664 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:43,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1690169939, now seen corresponding path program 30 times [2018-11-07 05:05:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:43,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:43,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:43,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:43,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:44,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:44,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:44,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:44,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:44,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:44,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:44,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:44,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:45,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:46,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 68 [2018-11-07 05:05:46,623 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:46,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 05:05:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 05:05:46,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 05:05:46,625 INFO L87 Difference]: Start difference. First operand 231 states and 245 transitions. Second operand 68 states. [2018-11-07 05:05:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:48,013 INFO L93 Difference]: Finished difference Result 461 states and 541 transitions. [2018-11-07 05:05:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 05:05:48,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 272 [2018-11-07 05:05:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:48,015 INFO L225 Difference]: With dead ends: 461 [2018-11-07 05:05:48,015 INFO L226 Difference]: Without dead ends: 344 [2018-11-07 05:05:48,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 480 SyntacticMatches, 43 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2113, Invalid=5897, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:05:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-07 05:05:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 234. [2018-11-07 05:05:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 05:05:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 248 transitions. [2018-11-07 05:05:48,033 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 248 transitions. Word has length 272 [2018-11-07 05:05:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:48,033 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 248 transitions. [2018-11-07 05:05:48,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 05:05:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 248 transitions. [2018-11-07 05:05:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 05:05:48,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:48,035 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:48,035 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:48,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 306808457, now seen corresponding path program 31 times [2018-11-07 05:05:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:48,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:48,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:48,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 800 proven. 1174 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 05:05:49,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:49,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:49,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:49,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:49,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:49,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:49,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:49,854 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:49,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:50,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 05:05:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 31 [2018-11-07 05:05:50,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:50,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 05:05:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 05:05:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:05:50,559 INFO L87 Difference]: Start difference. First operand 234 states and 248 transitions. Second operand 30 states. [2018-11-07 05:05:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:50,972 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-11-07 05:05:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 05:05:50,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 275 [2018-11-07 05:05:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:50,975 INFO L225 Difference]: With dead ends: 250 [2018-11-07 05:05:50,975 INFO L226 Difference]: Without dead ends: 248 [2018-11-07 05:05:50,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 528 SyntacticMatches, 43 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:05:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-07 05:05:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-07 05:05:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 05:05:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-11-07 05:05:50,987 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 275 [2018-11-07 05:05:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:50,988 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-11-07 05:05:50,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 05:05:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-11-07 05:05:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 05:05:50,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:50,989 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:50,989 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:50,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2063423255, now seen corresponding path program 32 times [2018-11-07 05:05:50,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:50,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:52,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:52,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:52,288 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:52,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:52,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:52,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:52,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:52,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:52,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 05:05:52,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:52,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:53,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:54,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:54,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-11-07 05:05:54,182 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:54,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 05:05:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 05:05:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1323, Invalid=4227, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 05:05:54,184 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 73 states. [2018-11-07 05:05:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:55,520 INFO L93 Difference]: Finished difference Result 495 states and 579 transitions. [2018-11-07 05:05:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 05:05:55,520 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 293 [2018-11-07 05:05:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:55,522 INFO L225 Difference]: With dead ends: 495 [2018-11-07 05:05:55,522 INFO L226 Difference]: Without dead ends: 366 [2018-11-07 05:05:55,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 517 SyntacticMatches, 44 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:05:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-07 05:05:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 251. [2018-11-07 05:05:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 05:05:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 266 transitions. [2018-11-07 05:05:55,539 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 266 transitions. Word has length 293 [2018-11-07 05:05:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:55,540 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 266 transitions. [2018-11-07 05:05:55,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 05:05:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2018-11-07 05:05:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 05:05:55,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:55,542 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:55,542 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:55,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash -759000691, now seen corresponding path program 33 times [2018-11-07 05:05:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:55,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:55,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:55,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:56,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:56,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:56,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:56,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:56,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:56,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:56,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:56,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:56,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:56,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:56,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:57,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:05:58,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 74 [2018-11-07 05:05:58,759 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:58,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-11-07 05:05:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-07 05:05:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:05:58,761 INFO L87 Difference]: Start difference. First operand 251 states and 266 transitions. Second operand 74 states. [2018-11-07 05:06:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:00,150 INFO L93 Difference]: Finished difference Result 501 states and 588 transitions. [2018-11-07 05:06:00,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 05:06:00,150 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 296 [2018-11-07 05:06:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:00,152 INFO L225 Difference]: With dead ends: 501 [2018-11-07 05:06:00,152 INFO L226 Difference]: Without dead ends: 374 [2018-11-07 05:06:00,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 522 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:06:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-07 05:06:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 254. [2018-11-07 05:06:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-07 05:06:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 269 transitions. [2018-11-07 05:06:00,170 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 269 transitions. Word has length 296 [2018-11-07 05:06:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:00,171 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 269 transitions. [2018-11-07 05:06:00,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-11-07 05:06:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 269 transitions. [2018-11-07 05:06:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-07 05:06:00,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:00,173 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:00,173 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:00,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1570490775, now seen corresponding path program 34 times [2018-11-07 05:06:00,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:00,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:00,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 945 proven. 1401 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-07 05:06:00,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:00,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:00,829 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:00,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:00,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:00,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:00,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:00,838 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:06:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:00,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:06:01,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 05:06:01,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:01,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 33 [2018-11-07 05:06:01,746 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:01,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 05:06:01,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 05:06:01,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:06:01,747 INFO L87 Difference]: Start difference. First operand 254 states and 269 transitions. Second operand 32 states. [2018-11-07 05:06:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:02,251 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-11-07 05:06:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 05:06:02,251 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 299 [2018-11-07 05:06:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:02,253 INFO L225 Difference]: With dead ends: 270 [2018-11-07 05:06:02,253 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 05:06:02,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 574 SyntacticMatches, 47 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 05:06:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 05:06:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-11-07 05:06:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-07 05:06:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2018-11-07 05:06:02,271 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 299 [2018-11-07 05:06:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:02,271 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2018-11-07 05:06:02,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 05:06:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2018-11-07 05:06:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-07 05:06:02,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:02,274 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:02,274 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:02,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1887772873, now seen corresponding path program 35 times [2018-11-07 05:06:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:02,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:02,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:03,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:03,604 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:03,604 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:03,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:03,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:03,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:03,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:06:03,613 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:06:03,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 05:06:03,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:03,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:05,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:05,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:05,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-11-07 05:06:05,933 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:05,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-07 05:06:05,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-07 05:06:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1537, Invalid=4943, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 05:06:05,935 INFO L87 Difference]: Start difference. First operand 268 states and 284 transitions. Second operand 79 states. [2018-11-07 05:06:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:07,876 INFO L93 Difference]: Finished difference Result 535 states and 626 transitions. [2018-11-07 05:06:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 05:06:07,876 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 317 [2018-11-07 05:06:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:07,878 INFO L225 Difference]: With dead ends: 535 [2018-11-07 05:06:07,878 INFO L226 Difference]: Without dead ends: 396 [2018-11-07 05:06:07,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 559 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:06:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-07 05:06:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-11-07 05:06:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-07 05:06:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 287 transitions. [2018-11-07 05:06:07,897 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 287 transitions. Word has length 317 [2018-11-07 05:06:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:07,898 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 287 transitions. [2018-11-07 05:06:07,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-07 05:06:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 287 transitions. [2018-11-07 05:06:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-07 05:06:07,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:07,900 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:07,900 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:07,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:07,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1510056595, now seen corresponding path program 36 times [2018-11-07 05:06:07,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:07,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:07,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:07,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:09,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:09,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:09,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:09,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:09,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:09,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:06:09,077 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:06:09,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:06:09,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:09,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:10,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:11,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 80 [2018-11-07 05:06:11,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:11,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 05:06:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 05:06:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 05:06:11,286 INFO L87 Difference]: Start difference. First operand 271 states and 287 transitions. Second operand 80 states. [2018-11-07 05:06:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:13,192 INFO L93 Difference]: Finished difference Result 541 states and 635 transitions. [2018-11-07 05:06:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 05:06:13,193 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 320 [2018-11-07 05:06:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:13,194 INFO L225 Difference]: With dead ends: 541 [2018-11-07 05:06:13,194 INFO L226 Difference]: Without dead ends: 404 [2018-11-07 05:06:13,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 564 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2913, Invalid=8217, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:06:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-07 05:06:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 274. [2018-11-07 05:06:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 05:06:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 290 transitions. [2018-11-07 05:06:13,214 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 290 transitions. Word has length 320 [2018-11-07 05:06:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:13,214 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 290 transitions. [2018-11-07 05:06:13,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 05:06:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 290 transitions. [2018-11-07 05:06:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 05:06:13,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:13,216 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:13,216 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:13,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1836461641, now seen corresponding path program 37 times [2018-11-07 05:06:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:13,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:13,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1102 proven. 1648 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-07 05:06:14,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:14,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:14,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:14,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:14,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:14,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:14,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:14,387 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:06:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:14,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:15,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 05:06:16,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:16,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 35 [2018-11-07 05:06:16,006 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:16,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 05:06:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 05:06:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 05:06:16,007 INFO L87 Difference]: Start difference. First operand 274 states and 290 transitions. Second operand 34 states. [2018-11-07 05:06:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:16,377 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-11-07 05:06:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 05:06:16,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 323 [2018-11-07 05:06:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:16,380 INFO L225 Difference]: With dead ends: 290 [2018-11-07 05:06:16,380 INFO L226 Difference]: Without dead ends: 288 [2018-11-07 05:06:16,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 620 SyntacticMatches, 51 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 05:06:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-07 05:06:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-07 05:06:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-07 05:06:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 305 transitions. [2018-11-07 05:06:16,399 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 305 transitions. Word has length 323 [2018-11-07 05:06:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:16,400 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 305 transitions. [2018-11-07 05:06:16,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 05:06:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 305 transitions. [2018-11-07 05:06:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-07 05:06:16,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:16,403 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:16,403 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:16,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1388109993, now seen corresponding path program 38 times [2018-11-07 05:06:16,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:16,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:16,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:18,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:18,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:18,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:18,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:18,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:18,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:06:18,302 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:06:18,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-07 05:06:18,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:18,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:19,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-11-07 05:06:21,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:21,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 05:06:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 05:06:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5715, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 05:06:21,518 INFO L87 Difference]: Start difference. First operand 288 states and 305 transitions. Second operand 85 states. [2018-11-07 05:06:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:23,278 INFO L93 Difference]: Finished difference Result 575 states and 673 transitions. [2018-11-07 05:06:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 05:06:23,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 341 [2018-11-07 05:06:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:23,281 INFO L225 Difference]: With dead ends: 575 [2018-11-07 05:06:23,281 INFO L226 Difference]: Without dead ends: 426 [2018-11-07 05:06:23,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 601 SyntacticMatches, 52 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3360, Invalid=9522, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:06:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-07 05:06:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 291. [2018-11-07 05:06:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-07 05:06:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 308 transitions. [2018-11-07 05:06:23,302 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 308 transitions. Word has length 341 [2018-11-07 05:06:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:23,303 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 308 transitions. [2018-11-07 05:06:23,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 05:06:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 308 transitions. [2018-11-07 05:06:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-07 05:06:23,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:23,305 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:23,306 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:23,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -298618547, now seen corresponding path program 39 times [2018-11-07 05:06:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:23,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:23,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:24,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:24,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:24,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:24,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:24,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:24,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:24,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:06:24,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:06:24,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:06:24,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:24,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:26,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 86 [2018-11-07 05:06:27,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:27,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-11-07 05:06:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-11-07 05:06:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 05:06:27,932 INFO L87 Difference]: Start difference. First operand 291 states and 308 transitions. Second operand 86 states. [2018-11-07 05:06:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:29,643 INFO L93 Difference]: Finished difference Result 581 states and 682 transitions. [2018-11-07 05:06:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 05:06:29,643 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 344 [2018-11-07 05:06:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:29,646 INFO L225 Difference]: With dead ends: 581 [2018-11-07 05:06:29,646 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 05:06:29,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 606 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3361, Invalid=9521, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:06:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 05:06:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 294. [2018-11-07 05:06:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 05:06:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 311 transitions. [2018-11-07 05:06:29,667 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 311 transitions. Word has length 344 [2018-11-07 05:06:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:29,667 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 311 transitions. [2018-11-07 05:06:29,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-11-07 05:06:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 311 transitions. [2018-11-07 05:06:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 05:06:29,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:29,669 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:29,670 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:29,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1488809513, now seen corresponding path program 40 times [2018-11-07 05:06:29,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:29,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:29,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1271 proven. 1915 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-07 05:06:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:30,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:30,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:30,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:30,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:30,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:30,512 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:06:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:30,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:30,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 05:06:31,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 37 [2018-11-07 05:06:31,460 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:31,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 05:06:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 05:06:31,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 05:06:31,461 INFO L87 Difference]: Start difference. First operand 294 states and 311 transitions. Second operand 36 states. [2018-11-07 05:06:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:31,871 INFO L93 Difference]: Finished difference Result 310 states and 328 transitions. [2018-11-07 05:06:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 05:06:31,872 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-11-07 05:06:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:31,874 INFO L225 Difference]: With dead ends: 310 [2018-11-07 05:06:31,874 INFO L226 Difference]: Without dead ends: 308 [2018-11-07 05:06:31,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 666 SyntacticMatches, 55 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 05:06:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-07 05:06:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-11-07 05:06:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-07 05:06:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2018-11-07 05:06:31,892 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 347 [2018-11-07 05:06:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2018-11-07 05:06:31,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 05:06:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2018-11-07 05:06:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-07 05:06:31,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:31,895 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:31,895 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:31,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2103961737, now seen corresponding path program 41 times [2018-11-07 05:06:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:33,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:33,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:33,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:33,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:06:33,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:06:33,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 05:06:33,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:33,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:35,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:36,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:36,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-11-07 05:06:36,671 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:36,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-07 05:06:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-07 05:06:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2013, Invalid=6543, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:06:36,673 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 91 states. [2018-11-07 05:06:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:38,687 INFO L93 Difference]: Finished difference Result 615 states and 720 transitions. [2018-11-07 05:06:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 05:06:38,687 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 365 [2018-11-07 05:06:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:38,690 INFO L225 Difference]: With dead ends: 615 [2018-11-07 05:06:38,690 INFO L226 Difference]: Without dead ends: 456 [2018-11-07 05:06:38,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 643 SyntacticMatches, 56 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 05:06:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-07 05:06:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 311. [2018-11-07 05:06:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-07 05:06:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 329 transitions. [2018-11-07 05:06:38,712 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 329 transitions. Word has length 365 [2018-11-07 05:06:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:38,713 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 329 transitions. [2018-11-07 05:06:38,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-07 05:06:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 329 transitions. [2018-11-07 05:06:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-07 05:06:38,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:38,716 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:38,716 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:38,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1897909549, now seen corresponding path program 42 times [2018-11-07 05:06:38,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:38,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:38,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:40,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:40,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:40,013 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:40,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:40,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:40,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:40,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:06:40,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:06:40,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:06:40,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:40,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:41,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:42,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:42,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 92 [2018-11-07 05:06:42,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:42,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-11-07 05:06:42,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-11-07 05:06:42,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 05:06:42,796 INFO L87 Difference]: Start difference. First operand 311 states and 329 transitions. Second operand 92 states. [2018-11-07 05:06:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:44,772 INFO L93 Difference]: Finished difference Result 621 states and 729 transitions. [2018-11-07 05:06:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 05:06:44,772 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 368 [2018-11-07 05:06:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:44,774 INFO L225 Difference]: With dead ends: 621 [2018-11-07 05:06:44,774 INFO L226 Difference]: Without dead ends: 464 [2018-11-07 05:06:44,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 648 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3841, Invalid=10921, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 05:06:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-07 05:06:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 314. [2018-11-07 05:06:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-07 05:06:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 332 transitions. [2018-11-07 05:06:44,798 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 332 transitions. Word has length 368 [2018-11-07 05:06:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:44,798 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 332 transitions. [2018-11-07 05:06:44,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-11-07 05:06:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 332 transitions. [2018-11-07 05:06:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-07 05:06:44,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:44,801 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:44,801 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:44,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 905442825, now seen corresponding path program 43 times [2018-11-07 05:06:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:44,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:44,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1452 proven. 2202 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-07 05:06:45,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:45,500 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:45,500 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:45,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:45,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:45,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:45,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:45,511 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:06:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:45,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:45,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 05:06:46,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:46,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 39 [2018-11-07 05:06:46,653 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:46,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 05:06:46,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 05:06:46,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 05:06:46,654 INFO L87 Difference]: Start difference. First operand 314 states and 332 transitions. Second operand 38 states. [2018-11-07 05:06:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:47,016 INFO L93 Difference]: Finished difference Result 330 states and 349 transitions. [2018-11-07 05:06:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 05:06:47,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 371 [2018-11-07 05:06:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:47,019 INFO L225 Difference]: With dead ends: 330 [2018-11-07 05:06:47,019 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 05:06:47,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 712 SyntacticMatches, 59 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:06:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 05:06:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-07 05:06:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-07 05:06:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 347 transitions. [2018-11-07 05:06:47,040 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 347 transitions. Word has length 371 [2018-11-07 05:06:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:47,041 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 347 transitions. [2018-11-07 05:06:47,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 05:06:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 347 transitions. [2018-11-07 05:06:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 05:06:47,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:47,044 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:47,044 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:47,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash 247740521, now seen corresponding path program 44 times [2018-11-07 05:06:47,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:47,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:06:48,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:48,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:48,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:48,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:48,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:48,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:06:48,757 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:06:48,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 05:06:48,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:48,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:06:50,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:06:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:51,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-11-07 05:06:51,882 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:51,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 05:06:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 05:06:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2275, Invalid=7427, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 05:06:51,884 INFO L87 Difference]: Start difference. First operand 328 states and 347 transitions. Second operand 97 states. [2018-11-07 05:06:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:58,076 INFO L93 Difference]: Finished difference Result 655 states and 767 transitions. [2018-11-07 05:06:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 05:06:58,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 389 [2018-11-07 05:06:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:58,078 INFO L225 Difference]: With dead ends: 655 [2018-11-07 05:06:58,079 INFO L226 Difference]: Without dead ends: 486 [2018-11-07 05:06:58,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 685 SyntacticMatches, 60 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5951 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 05:06:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-07 05:06:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 331. [2018-11-07 05:06:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-07 05:06:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 350 transitions. [2018-11-07 05:06:58,099 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 350 transitions. Word has length 389 [2018-11-07 05:06:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:58,099 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 350 transitions. [2018-11-07 05:06:58,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 05:06:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 350 transitions. [2018-11-07 05:06:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-07 05:06:58,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:58,102 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:58,102 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:58,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1056870131, now seen corresponding path program 45 times [2018-11-07 05:06:58,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:58,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:58,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:06:59,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:59,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:59,796 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:59,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:59,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:59,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:06:59,806 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:06:59,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:06:59,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:59,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:07:01,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:07:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:02,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 98 [2018-11-07 05:07:02,925 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:02,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-07 05:07:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-07 05:07:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2209, Invalid=7297, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:07:02,927 INFO L87 Difference]: Start difference. First operand 331 states and 350 transitions. Second operand 98 states. [2018-11-07 05:07:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:05,146 INFO L93 Difference]: Finished difference Result 661 states and 776 transitions. [2018-11-07 05:07:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 05:07:05,146 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 392 [2018-11-07 05:07:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:05,148 INFO L225 Difference]: With dead ends: 661 [2018-11-07 05:07:05,148 INFO L226 Difference]: Without dead ends: 494 [2018-11-07 05:07:05,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 690 SyntacticMatches, 63 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4353, Invalid=12417, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 05:07:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-07 05:07:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 334. [2018-11-07 05:07:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 05:07:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 353 transitions. [2018-11-07 05:07:05,167 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 353 transitions. Word has length 392 [2018-11-07 05:07:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:05,168 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 353 transitions. [2018-11-07 05:07:05,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-07 05:07:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 353 transitions. [2018-11-07 05:07:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 05:07:05,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:05,170 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:05,170 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:05,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1553742359, now seen corresponding path program 46 times [2018-11-07 05:07:05,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:05,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:05,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:05,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1645 proven. 2509 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-07 05:07:06,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:06,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:06,164 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:06,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:06,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:06,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:06,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:06,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:07:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:06,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:07:06,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 05:07:07,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:07,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 41 [2018-11-07 05:07:07,350 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:07,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 05:07:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 05:07:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:07:07,352 INFO L87 Difference]: Start difference. First operand 334 states and 353 transitions. Second operand 40 states. [2018-11-07 05:07:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:07,834 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-11-07 05:07:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 05:07:07,835 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 395 [2018-11-07 05:07:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:07,837 INFO L225 Difference]: With dead ends: 350 [2018-11-07 05:07:07,837 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 05:07:07,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 758 SyntacticMatches, 63 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 05:07:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 05:07:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-11-07 05:07:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-07 05:07:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 368 transitions. [2018-11-07 05:07:07,857 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 368 transitions. Word has length 395 [2018-11-07 05:07:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:07,857 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 368 transitions. [2018-11-07 05:07:07,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 05:07:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 368 transitions. [2018-11-07 05:07:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-07 05:07:07,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:07,860 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:07,860 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:07,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash -779104183, now seen corresponding path program 47 times [2018-11-07 05:07:07,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:07,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:09,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:09,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:09,746 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:09,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:09,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:09,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:09,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:07:09,755 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:07:09,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-07 05:07:09,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:09,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:11,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:13,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:13,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-11-07 05:07:13,396 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:13,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-11-07 05:07:13,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-11-07 05:07:13,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2553, Invalid=8367, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 05:07:13,398 INFO L87 Difference]: Start difference. First operand 348 states and 368 transitions. Second operand 103 states. [2018-11-07 05:07:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:15,915 INFO L93 Difference]: Finished difference Result 695 states and 814 transitions. [2018-11-07 05:07:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 05:07:15,916 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 413 [2018-11-07 05:07:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:15,918 INFO L225 Difference]: With dead ends: 695 [2018-11-07 05:07:15,918 INFO L226 Difference]: Without dead ends: 516 [2018-11-07 05:07:15,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 727 SyntacticMatches, 64 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4896, Invalid=14010, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 05:07:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-11-07 05:07:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 351. [2018-11-07 05:07:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 05:07:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 371 transitions. [2018-11-07 05:07:15,942 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 371 transitions. Word has length 413 [2018-11-07 05:07:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:15,942 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 371 transitions. [2018-11-07 05:07:15,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-11-07 05:07:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 371 transitions. [2018-11-07 05:07:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-07 05:07:15,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:15,945 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:15,945 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:15,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 479616237, now seen corresponding path program 48 times [2018-11-07 05:07:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:15,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:15,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:17,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:17,787 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:17,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:17,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:17,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:07:17,795 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:07:17,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:07:17,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:17,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:20,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:21,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:21,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 104 [2018-11-07 05:07:21,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:21,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 05:07:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 05:07:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2483, Invalid=8229, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 05:07:21,581 INFO L87 Difference]: Start difference. First operand 351 states and 371 transitions. Second operand 104 states. [2018-11-07 05:07:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:24,435 INFO L93 Difference]: Finished difference Result 701 states and 823 transitions. [2018-11-07 05:07:24,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 05:07:24,436 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 416 [2018-11-07 05:07:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:24,438 INFO L225 Difference]: With dead ends: 701 [2018-11-07 05:07:24,438 INFO L226 Difference]: Without dead ends: 524 [2018-11-07 05:07:24,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 732 SyntacticMatches, 67 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4897, Invalid=14009, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 05:07:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-07 05:07:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 354. [2018-11-07 05:07:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-07 05:07:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2018-11-07 05:07:24,466 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 416 [2018-11-07 05:07:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:24,466 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2018-11-07 05:07:24,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 05:07:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2018-11-07 05:07:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-07 05:07:24,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:24,469 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:24,470 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:24,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -339812919, now seen corresponding path program 49 times [2018-11-07 05:07:24,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:24,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:24,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1850 proven. 2836 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-07 05:07:25,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:25,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:25,353 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:25,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:25,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:25,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:25,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:25,362 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:07:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:25,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:25,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 05:07:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 43 [2018-11-07 05:07:26,683 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:26,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 05:07:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 05:07:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 05:07:26,684 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand 42 states. [2018-11-07 05:07:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:27,222 INFO L93 Difference]: Finished difference Result 370 states and 391 transitions. [2018-11-07 05:07:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 05:07:27,222 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 419 [2018-11-07 05:07:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:27,225 INFO L225 Difference]: With dead ends: 370 [2018-11-07 05:07:27,225 INFO L226 Difference]: Without dead ends: 368 [2018-11-07 05:07:27,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 804 SyntacticMatches, 67 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:07:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-07 05:07:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-11-07 05:07:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-07 05:07:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 389 transitions. [2018-11-07 05:07:27,243 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 389 transitions. Word has length 419 [2018-11-07 05:07:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:27,243 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 389 transitions. [2018-11-07 05:07:27,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 05:07:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 389 transitions. [2018-11-07 05:07:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-07 05:07:27,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:27,246 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:27,246 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:27,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:27,246 INFO L82 PathProgramCache]: Analyzing trace with hash 487108649, now seen corresponding path program 50 times [2018-11-07 05:07:27,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:27,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:29,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:29,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:29,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:29,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:29,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:29,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:29,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:07:29,121 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:07:29,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 05:07:29,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:29,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:31,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:33,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:33,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-11-07 05:07:33,175 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-11-07 05:07:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-11-07 05:07:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2847, Invalid=9363, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 05:07:33,177 INFO L87 Difference]: Start difference. First operand 368 states and 389 transitions. Second operand 109 states. [2018-11-07 05:07:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:36,019 INFO L93 Difference]: Finished difference Result 735 states and 861 transitions. [2018-11-07 05:07:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 05:07:36,020 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 437 [2018-11-07 05:07:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:36,022 INFO L225 Difference]: With dead ends: 735 [2018-11-07 05:07:36,022 INFO L226 Difference]: Without dead ends: 546 [2018-11-07 05:07:36,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 769 SyntacticMatches, 68 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7559 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5472, Invalid=15698, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 05:07:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-07 05:07:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2018-11-07 05:07:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-07 05:07:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 392 transitions. [2018-11-07 05:07:36,045 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 392 transitions. Word has length 437 [2018-11-07 05:07:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:36,046 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 392 transitions. [2018-11-07 05:07:36,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-11-07 05:07:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 392 transitions. [2018-11-07 05:07:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 05:07:36,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:36,048 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:36,048 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:36,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1327272141, now seen corresponding path program 51 times [2018-11-07 05:07:36,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:36,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:36,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:37,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:37,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:37,952 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:37,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:37,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:37,953 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:07:37,961 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:07:38,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:07:38,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:38,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:40,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:42,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 110 [2018-11-07 05:07:42,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:42,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-11-07 05:07:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-11-07 05:07:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2773, Invalid=9217, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 05:07:42,286 INFO L87 Difference]: Start difference. First operand 371 states and 392 transitions. Second operand 110 states. [2018-11-07 05:07:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:45,252 INFO L93 Difference]: Finished difference Result 741 states and 870 transitions. [2018-11-07 05:07:45,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 05:07:45,252 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 440 [2018-11-07 05:07:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:45,254 INFO L225 Difference]: With dead ends: 741 [2018-11-07 05:07:45,254 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 05:07:45,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 774 SyntacticMatches, 71 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5473, Invalid=15697, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 05:07:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 05:07:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 374. [2018-11-07 05:07:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-07 05:07:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 395 transitions. [2018-11-07 05:07:45,277 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 395 transitions. Word has length 440 [2018-11-07 05:07:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 395 transitions. [2018-11-07 05:07:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-11-07 05:07:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 395 transitions. [2018-11-07 05:07:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-11-07 05:07:45,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:45,280 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:45,280 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -431538775, now seen corresponding path program 52 times [2018-11-07 05:07:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:45,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:45,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2067 proven. 3183 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-07 05:07:46,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:46,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:46,228 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:46,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:46,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:46,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:46,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:46,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:07:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:46,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:46,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 05:07:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:47,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 45 [2018-11-07 05:07:47,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:47,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 05:07:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 05:07:47,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:07:47,690 INFO L87 Difference]: Start difference. First operand 374 states and 395 transitions. Second operand 44 states. [2018-11-07 05:07:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:48,287 INFO L93 Difference]: Finished difference Result 390 states and 412 transitions. [2018-11-07 05:07:48,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 05:07:48,287 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 443 [2018-11-07 05:07:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:48,290 INFO L225 Difference]: With dead ends: 390 [2018-11-07 05:07:48,290 INFO L226 Difference]: Without dead ends: 388 [2018-11-07 05:07:48,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 850 SyntacticMatches, 71 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 05:07:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-07 05:07:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-11-07 05:07:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 05:07:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 410 transitions. [2018-11-07 05:07:48,308 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 410 transitions. Word has length 443 [2018-11-07 05:07:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:48,309 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 410 transitions. [2018-11-07 05:07:48,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 05:07:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 410 transitions. [2018-11-07 05:07:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-07 05:07:48,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:48,311 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:48,311 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:48,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1259546615, now seen corresponding path program 53 times [2018-11-07 05:07:48,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:48,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:07:50,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:50,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:50,569 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:50,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:50,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:50,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:50,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:07:50,580 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:07:50,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 05:07:50,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:50,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:07:53,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:07:55,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:55,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-11-07 05:07:55,353 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:55,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-11-07 05:07:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-11-07 05:07:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3157, Invalid=10415, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 05:07:55,355 INFO L87 Difference]: Start difference. First operand 388 states and 410 transitions. Second operand 115 states. [2018-11-07 05:07:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:58,819 INFO L93 Difference]: Finished difference Result 775 states and 908 transitions. [2018-11-07 05:07:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-07 05:07:58,820 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 461 [2018-11-07 05:07:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:58,822 INFO L225 Difference]: With dead ends: 775 [2018-11-07 05:07:58,822 INFO L226 Difference]: Without dead ends: 576 [2018-11-07 05:07:58,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 811 SyntacticMatches, 72 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6080, Invalid=17482, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 05:07:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-07 05:07:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2018-11-07 05:07:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-11-07 05:07:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 413 transitions. [2018-11-07 05:07:58,846 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 413 transitions. Word has length 461 [2018-11-07 05:07:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:58,847 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 413 transitions. [2018-11-07 05:07:58,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-11-07 05:07:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 413 transitions. [2018-11-07 05:07:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-11-07 05:07:58,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:58,849 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:58,849 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:58,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1873670995, now seen corresponding path program 54 times [2018-11-07 05:07:58,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:58,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:58,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:08:01,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:01,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:01,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:01,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:01,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:01,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:01,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:01,117 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:01,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:01,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:01,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:08:03,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:08:05,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:05,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 116 [2018-11-07 05:08:05,577 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:05,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-07 05:08:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-07 05:08:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=10261, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 05:08:05,579 INFO L87 Difference]: Start difference. First operand 391 states and 413 transitions. Second operand 116 states. [2018-11-07 05:08:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:08,465 INFO L93 Difference]: Finished difference Result 781 states and 917 transitions. [2018-11-07 05:08:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-07 05:08:08,465 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 464 [2018-11-07 05:08:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:08,468 INFO L225 Difference]: With dead ends: 781 [2018-11-07 05:08:08,468 INFO L226 Difference]: Without dead ends: 584 [2018-11-07 05:08:08,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 816 SyntacticMatches, 75 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8362 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6081, Invalid=17481, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 05:08:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-07 05:08:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 394. [2018-11-07 05:08:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-07 05:08:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 416 transitions. [2018-11-07 05:08:08,490 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 416 transitions. Word has length 464 [2018-11-07 05:08:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 416 transitions. [2018-11-07 05:08:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-07 05:08:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 416 transitions. [2018-11-07 05:08:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-07 05:08:08,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:08,493 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:08,493 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:08,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash -692394615, now seen corresponding path program 55 times [2018-11-07 05:08:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:08,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:08,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2296 proven. 3550 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-11-07 05:08:09,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:09,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:09,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:09,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:09,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:09,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:09,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:09,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:09,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:08:09,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 05:08:11,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:11,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 47 [2018-11-07 05:08:11,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:11,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 05:08:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 05:08:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=1289, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 05:08:11,509 INFO L87 Difference]: Start difference. First operand 394 states and 416 transitions. Second operand 46 states. [2018-11-07 05:08:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:12,561 INFO L93 Difference]: Finished difference Result 410 states and 433 transitions. [2018-11-07 05:08:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 05:08:12,562 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 467 [2018-11-07 05:08:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:12,564 INFO L225 Difference]: With dead ends: 410 [2018-11-07 05:08:12,564 INFO L226 Difference]: Without dead ends: 408 [2018-11-07 05:08:12,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 896 SyntacticMatches, 75 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=886, Invalid=1466, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:08:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-07 05:08:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-11-07 05:08:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-07 05:08:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 431 transitions. [2018-11-07 05:08:12,586 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 431 transitions. Word has length 467 [2018-11-07 05:08:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:12,586 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 431 transitions. [2018-11-07 05:08:12,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 05:08:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 431 transitions. [2018-11-07 05:08:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-07 05:08:12,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:12,589 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:12,589 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:12,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1451603991, now seen corresponding path program 56 times [2018-11-07 05:08:12,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:12,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:12,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:12,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:12,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 05:08:14,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:14,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:14,652 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:14,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:14,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:14,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:14,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:14,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:14,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-07 05:08:14,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:14,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 05:08:17,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 05:08:19,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:19,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-11-07 05:08:19,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:19,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-11-07 05:08:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-11-07 05:08:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=11523, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 05:08:19,715 INFO L87 Difference]: Start difference. First operand 408 states and 431 transitions. Second operand 121 states. [2018-11-07 05:08:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:22,871 INFO L93 Difference]: Finished difference Result 815 states and 955 transitions. [2018-11-07 05:08:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-07 05:08:22,879 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 485 [2018-11-07 05:08:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:22,882 INFO L225 Difference]: With dead ends: 815 [2018-11-07 05:08:22,882 INFO L226 Difference]: Without dead ends: 606 [2018-11-07 05:08:22,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 853 SyntacticMatches, 76 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9359 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6720, Invalid=19362, Unknown=0, NotChecked=0, Total=26082 [2018-11-07 05:08:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-07 05:08:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 411. [2018-11-07 05:08:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-07 05:08:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 434 transitions. [2018-11-07 05:08:22,906 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 434 transitions. Word has length 485 [2018-11-07 05:08:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:22,906 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 434 transitions. [2018-11-07 05:08:22,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-11-07 05:08:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 434 transitions. [2018-11-07 05:08:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-11-07 05:08:22,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:22,909 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:22,909 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:22,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1685377165, now seen corresponding path program 57 times [2018-11-07 05:08:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:22,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:22,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9204 backedges. 3900 proven. 2340 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 05:08:25,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:25,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:25,013 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:25,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:25,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:25,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:25,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:25,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:25,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:25,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:25,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9204 backedges. 3900 proven. 2340 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 05:08:27,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:08:28,556 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-11-07 05:08:28,556 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:08:28,757 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:28,757 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:08:28,762 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:08:28,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:28 BoogieIcfgContainer [2018-11-07 05:08:28,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:08:28,763 INFO L168 Benchmark]: Toolchain (without parser) took 228736.05 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.0 GB in the end (delta: -616.9 MB). Peak memory consumption was 475.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:28,764 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-07 05:08:28,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:28,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:28,765 INFO L168 Benchmark]: Boogie Preprocessor took 26.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:28,766 INFO L168 Benchmark]: RCFGBuilder took 539.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:28,766 INFO L168 Benchmark]: TraceAbstraction took 227833.69 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 343.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 171.8 MB). Peak memory consumption was 515.3 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:28,770 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 309.70 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.18 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 26.77 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 539.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227833.69 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 343.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 171.8 MB). Peak memory consumption was 515.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 489 with TraceHistMax 40,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 227.7s OverallTime, 60 OverallIterations, 40 TraceHistogramMax, 70.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4798 SDtfs, 9849 SDslu, 47934 SDs, 0 SdLazy, 38252 SolverSat, 5510 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32427 GetRequests, 26432 SyntacticMatches, 2237 SemanticMatches, 3758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136409 ImplicationChecksByTransitivity, 142.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 59 MinimizatonAttempts, 3905 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 137.5s InterpolantComputationTime, 29161 NumberOfCodeBlocks, 29161 NumberOfCodeBlocksAsserted, 531 NumberOfCheckSat, 43538 ConstructedInterpolants, 0 QuantifiedInterpolants, 42473608 SizeOfPredicates, 150 NumberOfNonLiveVariables, 35027 ConjunctsInSsa, 2516 ConjunctsInUnsatCore, 171 InterpolantComputations, 3 PerfectInterpolantSequences, 368269/527315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown