java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:35:49,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:35:49,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:35:49,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:35:49,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:35:49,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:35:49,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:35:49,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:35:49,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:35:49,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:35:49,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:35:49,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:35:49,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:35:49,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:35:49,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:35:49,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:35:49,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:35:49,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:35:49,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:35:49,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:35:49,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:35:49,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:35:49,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:35:49,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:35:49,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:35:49,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:35:49,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:35:49,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:35:49,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:35:49,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:35:49,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:35:49,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:35:49,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:35:49,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:35:49,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:35:49,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:35:49,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:35:49,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:35:49,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:35:49,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:35:49,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:35:49,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:35:49,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:35:49,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:35:49,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:35:49,639 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:35:49,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:35:49,640 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:35:49,640 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:35:49,641 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:35:49,641 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:35:49,641 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:35:49,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:35:49,642 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:35:49,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:35:49,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:35:49,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:35:49,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:35:49,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:35:49,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:35:49,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:35:49,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:35:49,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:35:49,644 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:35:49,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:35:49,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:35:49,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:35:49,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:35:49,645 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:35:49,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:35:49,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:35:49,645 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:35:49,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:35:49,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:35:49,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:35:49,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:35:49,709 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:35:49,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:35:49,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420361260/94b63f8e42314bef9cc73efdf729830f/FLAG09bf53d82 [2019-09-10 06:35:50,327 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:35:50,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:35:50,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420361260/94b63f8e42314bef9cc73efdf729830f/FLAG09bf53d82 [2019-09-10 06:35:50,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420361260/94b63f8e42314bef9cc73efdf729830f [2019-09-10 06:35:50,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:35:50,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:35:50,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:35:50,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:35:50,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:35:50,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:35:50" (1/1) ... [2019-09-10 06:35:50,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185e190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:50, skipping insertion in model container [2019-09-10 06:35:50,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:35:50" (1/1) ... [2019-09-10 06:35:50,674 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:35:50,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:35:51,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:35:51,170 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:35:51,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:35:51,285 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:35:51,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51 WrapperNode [2019-09-10 06:35:51,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:35:51,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:35:51,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:35:51,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:35:51,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (1/1) ... [2019-09-10 06:35:51,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:35:51,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:35:51,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:35:51,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:35:51,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (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 [2019-09-10 06:35:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:35:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:35:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:35:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:35:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:35:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:35:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:35:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:35:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:35:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:35:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:35:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:35:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:35:52,358 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:35:52,358 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:35:52,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:35:52 BoogieIcfgContainer [2019-09-10 06:35:52,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:35:52,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:35:52,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:35:52,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:35:52,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:35:50" (1/3) ... [2019-09-10 06:35:52,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cce4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:35:52, skipping insertion in model container [2019-09-10 06:35:52,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:51" (2/3) ... [2019-09-10 06:35:52,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cce4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:35:52, skipping insertion in model container [2019-09-10 06:35:52,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:35:52" (3/3) ... [2019-09-10 06:35:52,369 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:35:52,381 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:35:52,399 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:35:52,417 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:35:52,441 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:35:52,441 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:35:52,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:35:52,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:35:52,442 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:35:52,442 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:35:52,442 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:35:52,443 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:35:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-09-10 06:35:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:35:52,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:52,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:52,488 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1995893501, now seen corresponding path program 1 times [2019-09-10 06:35:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:52,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:52,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:35:52,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:52,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:35:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:35:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:35:52,997 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 6 states. [2019-09-10 06:35:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:53,439 INFO L93 Difference]: Finished difference Result 732 states and 1137 transitions. [2019-09-10 06:35:53,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:35:53,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-10 06:35:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,472 INFO L225 Difference]: With dead ends: 732 [2019-09-10 06:35:53,473 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 06:35:53,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:35:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 06:35:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 469. [2019-09-10 06:35:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-10 06:35:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 711 transitions. [2019-09-10 06:35:53,573 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 711 transitions. Word has length 54 [2019-09-10 06:35:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:53,573 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 711 transitions. [2019-09-10 06:35:53,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:35:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 711 transitions. [2019-09-10 06:35:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:35:53,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:53,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:53,577 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1306112853, now seen corresponding path program 1 times [2019-09-10 06:35:53,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:53,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:53,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:53,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:53,712 INFO L87 Difference]: Start difference. First operand 469 states and 711 transitions. Second operand 3 states. [2019-09-10 06:35:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:53,756 INFO L93 Difference]: Finished difference Result 835 states and 1260 transitions. [2019-09-10 06:35:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:53,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:35:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,762 INFO L225 Difference]: With dead ends: 835 [2019-09-10 06:35:53,762 INFO L226 Difference]: Without dead ends: 835 [2019-09-10 06:35:53,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-10 06:35:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 833. [2019-09-10 06:35:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-10 06:35:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1259 transitions. [2019-09-10 06:35:53,801 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1259 transitions. Word has length 57 [2019-09-10 06:35:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:53,802 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1259 transitions. [2019-09-10 06:35:53,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1259 transitions. [2019-09-10 06:35:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:35:53,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:53,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:53,805 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1081311145, now seen corresponding path program 1 times [2019-09-10 06:35:53,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:53,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:53,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:53,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:53,897 INFO L87 Difference]: Start difference. First operand 833 states and 1259 transitions. Second operand 3 states. [2019-09-10 06:35:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:53,952 INFO L93 Difference]: Finished difference Result 1423 states and 2109 transitions. [2019-09-10 06:35:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:53,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:35:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,965 INFO L225 Difference]: With dead ends: 1423 [2019-09-10 06:35:53,966 INFO L226 Difference]: Without dead ends: 1423 [2019-09-10 06:35:53,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-10 06:35:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1421. [2019-09-10 06:35:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-10 06:35:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2108 transitions. [2019-09-10 06:35:54,010 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2108 transitions. Word has length 57 [2019-09-10 06:35:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:54,011 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2108 transitions. [2019-09-10 06:35:54,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2108 transitions. [2019-09-10 06:35:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:35:54,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:54,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:54,016 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1811397466, now seen corresponding path program 1 times [2019-09-10 06:35:54,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:54,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:35:54,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:54,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:35:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:35:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:35:54,137 INFO L87 Difference]: Start difference. First operand 1421 states and 2108 transitions. Second operand 5 states. [2019-09-10 06:35:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:54,477 INFO L93 Difference]: Finished difference Result 2673 states and 3954 transitions. [2019-09-10 06:35:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:54,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 06:35:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:54,492 INFO L225 Difference]: With dead ends: 2673 [2019-09-10 06:35:54,493 INFO L226 Difference]: Without dead ends: 2673 [2019-09-10 06:35:54,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-09-10 06:35:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2656. [2019-09-10 06:35:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-09-10 06:35:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3938 transitions. [2019-09-10 06:35:54,575 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3938 transitions. Word has length 58 [2019-09-10 06:35:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:54,576 INFO L475 AbstractCegarLoop]: Abstraction has 2656 states and 3938 transitions. [2019-09-10 06:35:54,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:35:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3938 transitions. [2019-09-10 06:35:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:35:54,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:54,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:54,588 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -211164811, now seen corresponding path program 1 times [2019-09-10 06:35:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:54,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:54,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:35:54,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:54,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:35:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:35:54,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:35:54,717 INFO L87 Difference]: Start difference. First operand 2656 states and 3938 transitions. Second operand 6 states. [2019-09-10 06:35:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:55,115 INFO L93 Difference]: Finished difference Result 5953 states and 8789 transitions. [2019-09-10 06:35:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:55,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-10 06:35:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:55,144 INFO L225 Difference]: With dead ends: 5953 [2019-09-10 06:35:55,144 INFO L226 Difference]: Without dead ends: 5953 [2019-09-10 06:35:55,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:35:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2019-09-10 06:35:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5909. [2019-09-10 06:35:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-09-10 06:35:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 8747 transitions. [2019-09-10 06:35:55,349 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 8747 transitions. Word has length 58 [2019-09-10 06:35:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:55,349 INFO L475 AbstractCegarLoop]: Abstraction has 5909 states and 8747 transitions. [2019-09-10 06:35:55,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:35:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 8747 transitions. [2019-09-10 06:35:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:35:55,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:55,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:55,352 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1182977442, now seen corresponding path program 1 times [2019-09-10 06:35:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:55,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:55,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:55,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:55,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:55,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:55,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:55,553 INFO L87 Difference]: Start difference. First operand 5909 states and 8747 transitions. Second operand 7 states. [2019-09-10 06:35:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:56,265 INFO L93 Difference]: Finished difference Result 21272 states and 31209 transitions. [2019-09-10 06:35:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:35:56,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-10 06:35:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:56,365 INFO L225 Difference]: With dead ends: 21272 [2019-09-10 06:35:56,365 INFO L226 Difference]: Without dead ends: 21272 [2019-09-10 06:35:56,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:35:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-09-10 06:35:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 5929. [2019-09-10 06:35:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-09-10 06:35:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 8771 transitions. [2019-09-10 06:35:56,636 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 8771 transitions. Word has length 59 [2019-09-10 06:35:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:56,637 INFO L475 AbstractCegarLoop]: Abstraction has 5929 states and 8771 transitions. [2019-09-10 06:35:56,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 8771 transitions. [2019-09-10 06:35:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:35:56,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:56,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:56,639 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1225107520, now seen corresponding path program 1 times [2019-09-10 06:35:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:56,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:56,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:56,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:56,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:56,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:56,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:56,735 INFO L87 Difference]: Start difference. First operand 5929 states and 8771 transitions. Second operand 7 states. [2019-09-10 06:35:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:57,468 INFO L93 Difference]: Finished difference Result 32008 states and 47809 transitions. [2019-09-10 06:35:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:35:57,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-10 06:35:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:57,544 INFO L225 Difference]: With dead ends: 32008 [2019-09-10 06:35:57,544 INFO L226 Difference]: Without dead ends: 32008 [2019-09-10 06:35:57,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:35:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-10 06:35:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 5965. [2019-09-10 06:35:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5965 states. [2019-09-10 06:35:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5965 states to 5965 states and 8817 transitions. [2019-09-10 06:35:57,939 INFO L78 Accepts]: Start accepts. Automaton has 5965 states and 8817 transitions. Word has length 59 [2019-09-10 06:35:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:57,941 INFO L475 AbstractCegarLoop]: Abstraction has 5965 states and 8817 transitions. [2019-09-10 06:35:57,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5965 states and 8817 transitions. [2019-09-10 06:35:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:35:57,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:57,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:57,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1930518435, now seen corresponding path program 1 times [2019-09-10 06:35:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:57,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:58,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:58,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:35:58,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:58,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:35:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:35:58,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:35:58,080 INFO L87 Difference]: Start difference. First operand 5965 states and 8817 transitions. Second operand 6 states. [2019-09-10 06:35:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:58,402 INFO L93 Difference]: Finished difference Result 15895 states and 23223 transitions. [2019-09-10 06:35:58,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:58,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-10 06:35:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:58,436 INFO L225 Difference]: With dead ends: 15895 [2019-09-10 06:35:58,436 INFO L226 Difference]: Without dead ends: 15895 [2019-09-10 06:35:58,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:35:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15895 states. [2019-09-10 06:35:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15895 to 15891. [2019-09-10 06:35:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15891 states. [2019-09-10 06:35:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 23221 transitions. [2019-09-10 06:35:58,780 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 23221 transitions. Word has length 60 [2019-09-10 06:35:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:58,780 INFO L475 AbstractCegarLoop]: Abstraction has 15891 states and 23221 transitions. [2019-09-10 06:35:58,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:35:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 23221 transitions. [2019-09-10 06:35:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:35:58,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:58,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:58,783 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -341979445, now seen corresponding path program 1 times [2019-09-10 06:35:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:58,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:58,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:35:58,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:58,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:35:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:35:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:35:58,875 INFO L87 Difference]: Start difference. First operand 15891 states and 23221 transitions. Second operand 5 states. [2019-09-10 06:35:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:59,043 INFO L93 Difference]: Finished difference Result 33205 states and 48710 transitions. [2019-09-10 06:35:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:59,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:35:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:59,104 INFO L225 Difference]: With dead ends: 33205 [2019-09-10 06:35:59,105 INFO L226 Difference]: Without dead ends: 33205 [2019-09-10 06:35:59,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33205 states. [2019-09-10 06:36:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33205 to 19510. [2019-09-10 06:36:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19510 states. [2019-09-10 06:36:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 28608 transitions. [2019-09-10 06:36:00,032 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 28608 transitions. Word has length 61 [2019-09-10 06:36:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:00,033 INFO L475 AbstractCegarLoop]: Abstraction has 19510 states and 28608 transitions. [2019-09-10 06:36:00,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 28608 transitions. [2019-09-10 06:36:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:00,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:00,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:00,039 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1558281363, now seen corresponding path program 1 times [2019-09-10 06:36:00,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:00,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:00,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:00,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:00,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:00,152 INFO L87 Difference]: Start difference. First operand 19510 states and 28608 transitions. Second operand 5 states. [2019-09-10 06:36:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:00,332 INFO L93 Difference]: Finished difference Result 36203 states and 53122 transitions. [2019-09-10 06:36:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:00,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:36:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:00,416 INFO L225 Difference]: With dead ends: 36203 [2019-09-10 06:36:00,417 INFO L226 Difference]: Without dead ends: 36203 [2019-09-10 06:36:00,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36203 states. [2019-09-10 06:36:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36203 to 23294. [2019-09-10 06:36:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23294 states. [2019-09-10 06:36:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23294 states to 23294 states and 34245 transitions. [2019-09-10 06:36:00,920 INFO L78 Accepts]: Start accepts. Automaton has 23294 states and 34245 transitions. Word has length 61 [2019-09-10 06:36:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:00,920 INFO L475 AbstractCegarLoop]: Abstraction has 23294 states and 34245 transitions. [2019-09-10 06:36:00,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23294 states and 34245 transitions. [2019-09-10 06:36:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:36:00,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:00,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:00,925 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1561793871, now seen corresponding path program 1 times [2019-09-10 06:36:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:00,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:00,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:00,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:00,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:00,976 INFO L87 Difference]: Start difference. First operand 23294 states and 34245 transitions. Second operand 3 states. [2019-09-10 06:36:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:01,092 INFO L93 Difference]: Finished difference Result 34679 states and 49882 transitions. [2019-09-10 06:36:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:01,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:36:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:01,145 INFO L225 Difference]: With dead ends: 34679 [2019-09-10 06:36:01,146 INFO L226 Difference]: Without dead ends: 34679 [2019-09-10 06:36:01,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34679 states. [2019-09-10 06:36:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34679 to 28265. [2019-09-10 06:36:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28265 states. [2019-09-10 06:36:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28265 states to 28265 states and 40900 transitions. [2019-09-10 06:36:01,885 INFO L78 Accepts]: Start accepts. Automaton has 28265 states and 40900 transitions. Word has length 64 [2019-09-10 06:36:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:01,886 INFO L475 AbstractCegarLoop]: Abstraction has 28265 states and 40900 transitions. [2019-09-10 06:36:01,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28265 states and 40900 transitions. [2019-09-10 06:36:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:36:01,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:01,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:01,892 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash -944536211, now seen corresponding path program 1 times [2019-09-10 06:36:01,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:01,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:01,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:01,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:01,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:01,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:01,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:01,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:01,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:01,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:01,988 INFO L87 Difference]: Start difference. First operand 28265 states and 40900 transitions. Second operand 7 states. [2019-09-10 06:36:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:02,788 INFO L93 Difference]: Finished difference Result 116669 states and 167239 transitions. [2019-09-10 06:36:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:02,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-10 06:36:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:02,943 INFO L225 Difference]: With dead ends: 116669 [2019-09-10 06:36:02,944 INFO L226 Difference]: Without dead ends: 116669 [2019-09-10 06:36:02,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:36:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116669 states. [2019-09-10 06:36:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116669 to 28375. [2019-09-10 06:36:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28375 states. [2019-09-10 06:36:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28375 states to 28375 states and 41042 transitions. [2019-09-10 06:36:04,854 INFO L78 Accepts]: Start accepts. Automaton has 28375 states and 41042 transitions. Word has length 64 [2019-09-10 06:36:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:04,855 INFO L475 AbstractCegarLoop]: Abstraction has 28375 states and 41042 transitions. [2019-09-10 06:36:04,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:36:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28375 states and 41042 transitions. [2019-09-10 06:36:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:36:04,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:04,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:04,860 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2106073500, now seen corresponding path program 1 times [2019-09-10 06:36:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:05,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:05,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:36:05,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:05,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:36:05,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:36:05,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:36:05,092 INFO L87 Difference]: Start difference. First operand 28375 states and 41042 transitions. Second operand 10 states. [2019-09-10 06:36:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:07,000 INFO L93 Difference]: Finished difference Result 74258 states and 106364 transitions. [2019-09-10 06:36:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:36:07,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:36:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:07,082 INFO L225 Difference]: With dead ends: 74258 [2019-09-10 06:36:07,083 INFO L226 Difference]: Without dead ends: 74258 [2019-09-10 06:36:07,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:36:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74258 states. [2019-09-10 06:36:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74258 to 28178. [2019-09-10 06:36:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28178 states. [2019-09-10 06:36:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28178 states to 28178 states and 40775 transitions. [2019-09-10 06:36:07,713 INFO L78 Accepts]: Start accepts. Automaton has 28178 states and 40775 transitions. Word has length 66 [2019-09-10 06:36:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:07,713 INFO L475 AbstractCegarLoop]: Abstraction has 28178 states and 40775 transitions. [2019-09-10 06:36:07,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:36:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28178 states and 40775 transitions. [2019-09-10 06:36:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:36:07,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:07,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:07,718 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:07,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1562834592, now seen corresponding path program 1 times [2019-09-10 06:36:07,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:07,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:07,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:07,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:07,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:36:07,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:36:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:36:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:36:07,928 INFO L87 Difference]: Start difference. First operand 28178 states and 40775 transitions. Second operand 10 states. [2019-09-10 06:36:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:09,873 INFO L93 Difference]: Finished difference Result 73761 states and 105687 transitions. [2019-09-10 06:36:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:36:09,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:36:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:09,964 INFO L225 Difference]: With dead ends: 73761 [2019-09-10 06:36:09,964 INFO L226 Difference]: Without dead ends: 73761 [2019-09-10 06:36:09,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:36:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73761 states. [2019-09-10 06:36:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73761 to 27916. [2019-09-10 06:36:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27916 states. [2019-09-10 06:36:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27916 states to 27916 states and 40388 transitions. [2019-09-10 06:36:10,544 INFO L78 Accepts]: Start accepts. Automaton has 27916 states and 40388 transitions. Word has length 66 [2019-09-10 06:36:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:10,544 INFO L475 AbstractCegarLoop]: Abstraction has 27916 states and 40388 transitions. [2019-09-10 06:36:10,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:36:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27916 states and 40388 transitions. [2019-09-10 06:36:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:36:10,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:10,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:10,548 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1195976158, now seen corresponding path program 1 times [2019-09-10 06:36:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:10,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:36:10,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:10,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:36:10,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:36:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:36:10,730 INFO L87 Difference]: Start difference. First operand 27916 states and 40388 transitions. Second operand 10 states. [2019-09-10 06:36:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:13,539 INFO L93 Difference]: Finished difference Result 100524 states and 142996 transitions. [2019-09-10 06:36:13,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:36:13,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:36:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:13,668 INFO L225 Difference]: With dead ends: 100524 [2019-09-10 06:36:13,668 INFO L226 Difference]: Without dead ends: 100524 [2019-09-10 06:36:13,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:36:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100524 states. [2019-09-10 06:36:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100524 to 27548. [2019-09-10 06:36:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27548 states. [2019-09-10 06:36:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27548 states to 27548 states and 39859 transitions. [2019-09-10 06:36:14,316 INFO L78 Accepts]: Start accepts. Automaton has 27548 states and 39859 transitions. Word has length 66 [2019-09-10 06:36:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:14,316 INFO L475 AbstractCegarLoop]: Abstraction has 27548 states and 39859 transitions. [2019-09-10 06:36:14,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:36:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27548 states and 39859 transitions. [2019-09-10 06:36:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:36:14,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:14,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:14,319 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -22489909, now seen corresponding path program 1 times [2019-09-10 06:36:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:14,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:14,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:14,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:14,381 INFO L87 Difference]: Start difference. First operand 27548 states and 39859 transitions. Second operand 3 states. [2019-09-10 06:36:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:14,488 INFO L93 Difference]: Finished difference Result 27550 states and 39238 transitions. [2019-09-10 06:36:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:14,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:36:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:14,528 INFO L225 Difference]: With dead ends: 27550 [2019-09-10 06:36:14,529 INFO L226 Difference]: Without dead ends: 27550 [2019-09-10 06:36:14,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-09-10 06:36:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 27548. [2019-09-10 06:36:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27548 states. [2019-09-10 06:36:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27548 states to 27548 states and 39237 transitions. [2019-09-10 06:36:15,007 INFO L78 Accepts]: Start accepts. Automaton has 27548 states and 39237 transitions. Word has length 67 [2019-09-10 06:36:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:15,008 INFO L475 AbstractCegarLoop]: Abstraction has 27548 states and 39237 transitions. [2019-09-10 06:36:15,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 27548 states and 39237 transitions. [2019-09-10 06:36:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:36:15,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:15,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:15,012 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash 910047089, now seen corresponding path program 1 times [2019-09-10 06:36:15,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:15,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:15,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:15,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:15,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:15,061 INFO L87 Difference]: Start difference. First operand 27548 states and 39237 transitions. Second operand 3 states. [2019-09-10 06:36:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:15,144 INFO L93 Difference]: Finished difference Result 24718 states and 34618 transitions. [2019-09-10 06:36:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:15,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:36:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:15,172 INFO L225 Difference]: With dead ends: 24718 [2019-09-10 06:36:15,173 INFO L226 Difference]: Without dead ends: 24718 [2019-09-10 06:36:15,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24718 states. [2019-09-10 06:36:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24718 to 24716. [2019-09-10 06:36:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24716 states. [2019-09-10 06:36:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24716 states to 24716 states and 34617 transitions. [2019-09-10 06:36:15,377 INFO L78 Accepts]: Start accepts. Automaton has 24716 states and 34617 transitions. Word has length 67 [2019-09-10 06:36:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:15,377 INFO L475 AbstractCegarLoop]: Abstraction has 24716 states and 34617 transitions. [2019-09-10 06:36:15,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24716 states and 34617 transitions. [2019-09-10 06:36:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:36:15,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:15,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:15,380 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 807080215, now seen corresponding path program 1 times [2019-09-10 06:36:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:15,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:15,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:15,425 INFO L87 Difference]: Start difference. First operand 24716 states and 34617 transitions. Second operand 3 states. [2019-09-10 06:36:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:15,505 INFO L93 Difference]: Finished difference Result 20911 states and 28667 transitions. [2019-09-10 06:36:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:15,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:36:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:15,528 INFO L225 Difference]: With dead ends: 20911 [2019-09-10 06:36:15,529 INFO L226 Difference]: Without dead ends: 20911 [2019-09-10 06:36:15,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-09-10 06:36:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20909. [2019-09-10 06:36:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20909 states. [2019-09-10 06:36:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20909 states to 20909 states and 28666 transitions. [2019-09-10 06:36:15,694 INFO L78 Accepts]: Start accepts. Automaton has 20909 states and 28666 transitions. Word has length 67 [2019-09-10 06:36:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:15,694 INFO L475 AbstractCegarLoop]: Abstraction has 20909 states and 28666 transitions. [2019-09-10 06:36:15,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20909 states and 28666 transitions. [2019-09-10 06:36:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:36:15,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:15,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:15,698 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 951021968, now seen corresponding path program 1 times [2019-09-10 06:36:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:16,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:16,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:36:16,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:16,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:36:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:36:16,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:36:16,457 INFO L87 Difference]: Start difference. First operand 20909 states and 28666 transitions. Second operand 17 states. [2019-09-10 06:36:17,064 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:36:17,267 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:36:17,637 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 06:36:17,944 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 06:36:18,114 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:36:18,335 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:36:18,593 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:36:18,762 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:36:19,107 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:36:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:21,321 INFO L93 Difference]: Finished difference Result 43652 states and 59914 transitions. [2019-09-10 06:36:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:36:21,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-09-10 06:36:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:21,371 INFO L225 Difference]: With dead ends: 43652 [2019-09-10 06:36:21,372 INFO L226 Difference]: Without dead ends: 43652 [2019-09-10 06:36:21,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:36:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43652 states. [2019-09-10 06:36:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43652 to 20825. [2019-09-10 06:36:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20825 states. [2019-09-10 06:36:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20825 states to 20825 states and 28554 transitions. [2019-09-10 06:36:21,640 INFO L78 Accepts]: Start accepts. Automaton has 20825 states and 28554 transitions. Word has length 68 [2019-09-10 06:36:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:21,641 INFO L475 AbstractCegarLoop]: Abstraction has 20825 states and 28554 transitions. [2019-09-10 06:36:21,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:36:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20825 states and 28554 transitions. [2019-09-10 06:36:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:36:21,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:21,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:21,645 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash 313084076, now seen corresponding path program 1 times [2019-09-10 06:36:21,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:21,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:22,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:22,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:36:22,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:22,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:36:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:36:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:36:22,342 INFO L87 Difference]: Start difference. First operand 20825 states and 28554 transitions. Second operand 16 states. [2019-09-10 06:36:22,684 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 06:36:22,845 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:36:23,138 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:36:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:25,316 INFO L93 Difference]: Finished difference Result 37765 states and 51970 transitions. [2019-09-10 06:36:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:36:25,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-09-10 06:36:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:25,354 INFO L225 Difference]: With dead ends: 37765 [2019-09-10 06:36:25,354 INFO L226 Difference]: Without dead ends: 37765 [2019-09-10 06:36:25,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:36:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-09-10 06:36:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 20656. [2019-09-10 06:36:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20656 states. [2019-09-10 06:36:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20656 states to 20656 states and 28324 transitions. [2019-09-10 06:36:25,575 INFO L78 Accepts]: Start accepts. Automaton has 20656 states and 28324 transitions. Word has length 68 [2019-09-10 06:36:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:25,576 INFO L475 AbstractCegarLoop]: Abstraction has 20656 states and 28324 transitions. [2019-09-10 06:36:25,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:36:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20656 states and 28324 transitions. [2019-09-10 06:36:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:36:25,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:25,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:25,580 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash 717078376, now seen corresponding path program 1 times [2019-09-10 06:36:25,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:25,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:25,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:25,616 INFO L87 Difference]: Start difference. First operand 20656 states and 28324 transitions. Second operand 3 states. [2019-09-10 06:36:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:25,728 INFO L93 Difference]: Finished difference Result 30925 states and 42440 transitions. [2019-09-10 06:36:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:25,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:36:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:25,772 INFO L225 Difference]: With dead ends: 30925 [2019-09-10 06:36:25,773 INFO L226 Difference]: Without dead ends: 30925 [2019-09-10 06:36:25,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30925 states. [2019-09-10 06:36:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30925 to 20511. [2019-09-10 06:36:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20511 states. [2019-09-10 06:36:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20511 states to 20511 states and 28081 transitions. [2019-09-10 06:36:26,070 INFO L78 Accepts]: Start accepts. Automaton has 20511 states and 28081 transitions. Word has length 68 [2019-09-10 06:36:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:26,070 INFO L475 AbstractCegarLoop]: Abstraction has 20511 states and 28081 transitions. [2019-09-10 06:36:26,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20511 states and 28081 transitions. [2019-09-10 06:36:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:36:26,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:26,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:26,075 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1369153575, now seen corresponding path program 1 times [2019-09-10 06:36:26,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:26,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:26,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:26,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:26,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:26,120 INFO L87 Difference]: Start difference. First operand 20511 states and 28081 transitions. Second operand 3 states. [2019-09-10 06:36:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:26,236 INFO L93 Difference]: Finished difference Result 30651 states and 42001 transitions. [2019-09-10 06:36:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:36:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:26,272 INFO L225 Difference]: With dead ends: 30651 [2019-09-10 06:36:26,273 INFO L226 Difference]: Without dead ends: 30651 [2019-09-10 06:36:26,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30651 states. [2019-09-10 06:36:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30651 to 20237. [2019-09-10 06:36:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20237 states. [2019-09-10 06:36:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20237 states to 20237 states and 27674 transitions. [2019-09-10 06:36:26,590 INFO L78 Accepts]: Start accepts. Automaton has 20237 states and 27674 transitions. Word has length 68 [2019-09-10 06:36:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:26,590 INFO L475 AbstractCegarLoop]: Abstraction has 20237 states and 27674 transitions. [2019-09-10 06:36:26,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20237 states and 27674 transitions. [2019-09-10 06:36:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:36:26,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:26,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:26,595 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1358366886, now seen corresponding path program 1 times [2019-09-10 06:36:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:26,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:26,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:26,674 INFO L87 Difference]: Start difference. First operand 20237 states and 27674 transitions. Second operand 5 states. [2019-09-10 06:36:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:26,784 INFO L93 Difference]: Finished difference Result 19377 states and 26531 transitions. [2019-09-10 06:36:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:26,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-10 06:36:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:26,806 INFO L225 Difference]: With dead ends: 19377 [2019-09-10 06:36:26,807 INFO L226 Difference]: Without dead ends: 19377 [2019-09-10 06:36:26,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19377 states. [2019-09-10 06:36:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19377 to 19373. [2019-09-10 06:36:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19373 states. [2019-09-10 06:36:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19373 states to 19373 states and 26529 transitions. [2019-09-10 06:36:26,946 INFO L78 Accepts]: Start accepts. Automaton has 19373 states and 26529 transitions. Word has length 73 [2019-09-10 06:36:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:26,946 INFO L475 AbstractCegarLoop]: Abstraction has 19373 states and 26529 transitions. [2019-09-10 06:36:26,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19373 states and 26529 transitions. [2019-09-10 06:36:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:36:26,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:26,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:26,950 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -168810636, now seen corresponding path program 1 times [2019-09-10 06:36:26,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:27,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:27,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:27,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:27,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:27,023 INFO L87 Difference]: Start difference. First operand 19373 states and 26529 transitions. Second operand 6 states. [2019-09-10 06:36:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:27,190 INFO L93 Difference]: Finished difference Result 36925 states and 49618 transitions. [2019-09-10 06:36:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:27,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:36:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:27,236 INFO L225 Difference]: With dead ends: 36925 [2019-09-10 06:36:27,236 INFO L226 Difference]: Without dead ends: 36925 [2019-09-10 06:36:27,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36925 states. [2019-09-10 06:36:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36925 to 20003. [2019-09-10 06:36:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20003 states. [2019-09-10 06:36:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20003 states to 20003 states and 26989 transitions. [2019-09-10 06:36:27,489 INFO L78 Accepts]: Start accepts. Automaton has 20003 states and 26989 transitions. Word has length 76 [2019-09-10 06:36:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:27,489 INFO L475 AbstractCegarLoop]: Abstraction has 20003 states and 26989 transitions. [2019-09-10 06:36:27,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20003 states and 26989 transitions. [2019-09-10 06:36:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:36:27,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:27,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:27,494 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1576523007, now seen corresponding path program 1 times [2019-09-10 06:36:27,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:27,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:27,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:27,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:27,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:27,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:27,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:27,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:27,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:27,538 INFO L87 Difference]: Start difference. First operand 20003 states and 26989 transitions. Second operand 3 states. [2019-09-10 06:36:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:27,665 INFO L93 Difference]: Finished difference Result 36787 states and 48898 transitions. [2019-09-10 06:36:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:27,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:36:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:27,716 INFO L225 Difference]: With dead ends: 36787 [2019-09-10 06:36:27,716 INFO L226 Difference]: Without dead ends: 36787 [2019-09-10 06:36:27,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36787 states. [2019-09-10 06:36:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36787 to 34153. [2019-09-10 06:36:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34153 states. [2019-09-10 06:36:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34153 states to 34153 states and 45523 transitions. [2019-09-10 06:36:28,110 INFO L78 Accepts]: Start accepts. Automaton has 34153 states and 45523 transitions. Word has length 77 [2019-09-10 06:36:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:28,110 INFO L475 AbstractCegarLoop]: Abstraction has 34153 states and 45523 transitions. [2019-09-10 06:36:28,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 34153 states and 45523 transitions. [2019-09-10 06:36:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:36:28,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:28,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:28,115 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash 175965857, now seen corresponding path program 1 times [2019-09-10 06:36:28,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:28,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:28,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:28,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:28,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:28,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:28,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:28,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:28,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:28,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:28,165 INFO L87 Difference]: Start difference. First operand 34153 states and 45523 transitions. Second operand 3 states. [2019-09-10 06:36:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:28,352 INFO L93 Difference]: Finished difference Result 50783 states and 67074 transitions. [2019-09-10 06:36:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:28,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:36:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:28,432 INFO L225 Difference]: With dead ends: 50783 [2019-09-10 06:36:28,433 INFO L226 Difference]: Without dead ends: 50783 [2019-09-10 06:36:28,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50783 states. [2019-09-10 06:36:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50783 to 50781. [2019-09-10 06:36:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50781 states. [2019-09-10 06:36:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50781 states to 50781 states and 67073 transitions. [2019-09-10 06:36:29,332 INFO L78 Accepts]: Start accepts. Automaton has 50781 states and 67073 transitions. Word has length 78 [2019-09-10 06:36:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:29,332 INFO L475 AbstractCegarLoop]: Abstraction has 50781 states and 67073 transitions. [2019-09-10 06:36:29,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50781 states and 67073 transitions. [2019-09-10 06:36:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:36:29,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:29,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:29,338 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -847980887, now seen corresponding path program 1 times [2019-09-10 06:36:29,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:29,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:29,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:29,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:29,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:29,394 INFO L87 Difference]: Start difference. First operand 50781 states and 67073 transitions. Second operand 5 states. [2019-09-10 06:36:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:30,108 INFO L93 Difference]: Finished difference Result 170885 states and 219858 transitions. [2019-09-10 06:36:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:30,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 06:36:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:30,388 INFO L225 Difference]: With dead ends: 170885 [2019-09-10 06:36:30,389 INFO L226 Difference]: Without dead ends: 170885 [2019-09-10 06:36:30,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170885 states. [2019-09-10 06:36:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170885 to 101189. [2019-09-10 06:36:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101189 states. [2019-09-10 06:36:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101189 states to 101189 states and 133237 transitions. [2019-09-10 06:36:33,678 INFO L78 Accepts]: Start accepts. Automaton has 101189 states and 133237 transitions. Word has length 86 [2019-09-10 06:36:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:33,679 INFO L475 AbstractCegarLoop]: Abstraction has 101189 states and 133237 transitions. [2019-09-10 06:36:33,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 101189 states and 133237 transitions. [2019-09-10 06:36:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:36:33,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:33,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:33,688 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:33,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1083848738, now seen corresponding path program 1 times [2019-09-10 06:36:33,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:33,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:33,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:33,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:33,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:33,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:33,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:33,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:33,757 INFO L87 Difference]: Start difference. First operand 101189 states and 133237 transitions. Second operand 5 states. [2019-09-10 06:36:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:34,495 INFO L93 Difference]: Finished difference Result 192010 states and 244832 transitions. [2019-09-10 06:36:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:34,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 06:36:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:34,726 INFO L225 Difference]: With dead ends: 192010 [2019-09-10 06:36:34,727 INFO L226 Difference]: Without dead ends: 192010 [2019-09-10 06:36:34,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192010 states. [2019-09-10 06:36:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192010 to 125479. [2019-09-10 06:36:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125479 states. [2019-09-10 06:36:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125479 states to 125479 states and 161716 transitions. [2019-09-10 06:36:38,445 INFO L78 Accepts]: Start accepts. Automaton has 125479 states and 161716 transitions. Word has length 92 [2019-09-10 06:36:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:38,446 INFO L475 AbstractCegarLoop]: Abstraction has 125479 states and 161716 transitions. [2019-09-10 06:36:38,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 125479 states and 161716 transitions. [2019-09-10 06:36:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:36:38,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:38,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:38,464 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:38,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1080560380, now seen corresponding path program 1 times [2019-09-10 06:36:38,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:38,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:38,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:38,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:36:38,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:38,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:38,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:38,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:38,516 INFO L87 Difference]: Start difference. First operand 125479 states and 161716 transitions. Second operand 3 states. [2019-09-10 06:36:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:39,054 INFO L93 Difference]: Finished difference Result 237051 states and 298429 transitions. [2019-09-10 06:36:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:39,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:36:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:39,375 INFO L225 Difference]: With dead ends: 237051 [2019-09-10 06:36:39,375 INFO L226 Difference]: Without dead ends: 237051 [2019-09-10 06:36:39,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237051 states. [2019-09-10 06:36:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237051 to 170555. [2019-09-10 06:36:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170555 states. [2019-09-10 06:36:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170555 states to 170555 states and 215732 transitions. [2019-09-10 06:36:43,851 INFO L78 Accepts]: Start accepts. Automaton has 170555 states and 215732 transitions. Word has length 97 [2019-09-10 06:36:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:43,851 INFO L475 AbstractCegarLoop]: Abstraction has 170555 states and 215732 transitions. [2019-09-10 06:36:43,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 170555 states and 215732 transitions. [2019-09-10 06:36:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:36:43,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:43,862 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:43,863 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 143028520, now seen corresponding path program 1 times [2019-09-10 06:36:43,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:43,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:43,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:43,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:43,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:43,908 INFO L87 Difference]: Start difference. First operand 170555 states and 215732 transitions. Second operand 3 states. [2019-09-10 06:36:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:45,169 INFO L93 Difference]: Finished difference Result 213303 states and 262133 transitions. [2019-09-10 06:36:45,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:45,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:36:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:45,448 INFO L225 Difference]: With dead ends: 213303 [2019-09-10 06:36:45,448 INFO L226 Difference]: Without dead ends: 213303 [2019-09-10 06:36:45,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213303 states. [2019-09-10 06:36:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213303 to 185161. [2019-09-10 06:36:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185161 states. [2019-09-10 06:36:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185161 states to 185161 states and 230164 transitions. [2019-09-10 06:36:51,460 INFO L78 Accepts]: Start accepts. Automaton has 185161 states and 230164 transitions. Word has length 98 [2019-09-10 06:36:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:51,460 INFO L475 AbstractCegarLoop]: Abstraction has 185161 states and 230164 transitions. [2019-09-10 06:36:51,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 185161 states and 230164 transitions. [2019-09-10 06:36:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:36:51,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:51,467 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:51,468 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1368780627, now seen corresponding path program 1 times [2019-09-10 06:36:51,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:51,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:36:51,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:36:51,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:36:51,573 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [443], [446], [449], [452], [454], [456], [498], [508], [522], [531], [547], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:36:51,616 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:36:51,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:36:51,730 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:36:52,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:36:52,094 INFO L272 AbstractInterpreter]: Visited 95 different actions 334 times. Merged at 31 different actions 209 times. Widened at 10 different actions 26 times. Performed 1281 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 123 variables. [2019-09-10 06:36:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:52,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:36:52,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:36:52,102 INFO L193 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 [2019-09-10 06:36:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:52,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:36:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:52,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:36:52,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:36:52,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:36:52,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:36:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:53,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:36:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:36:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:36:53,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:36:53,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 24 [2019-09-10 06:36:53,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:36:53,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:36:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:36:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:36:53,559 INFO L87 Difference]: Start difference. First operand 185161 states and 230164 transitions. Second operand 15 states. [2019-09-10 06:36:53,738 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:36:55,850 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:36:56,307 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 06:36:56,678 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 06:36:57,012 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 06:36:57,283 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:36:57,534 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-10 06:36:57,833 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:37:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:02,051 INFO L93 Difference]: Finished difference Result 415934 states and 515886 transitions. [2019-09-10 06:37:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:37:02,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 101 [2019-09-10 06:37:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:04,399 INFO L225 Difference]: With dead ends: 415934 [2019-09-10 06:37:04,400 INFO L226 Difference]: Without dead ends: 415934 [2019-09-10 06:37:04,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 172 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:37:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415934 states. [2019-09-10 06:37:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415934 to 243747. [2019-09-10 06:37:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243747 states. [2019-09-10 06:37:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243747 states to 243747 states and 303093 transitions. [2019-09-10 06:37:09,181 INFO L78 Accepts]: Start accepts. Automaton has 243747 states and 303093 transitions. Word has length 101 [2019-09-10 06:37:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:09,181 INFO L475 AbstractCegarLoop]: Abstraction has 243747 states and 303093 transitions. [2019-09-10 06:37:09,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:37:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 243747 states and 303093 transitions. [2019-09-10 06:37:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:37:09,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:09,215 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:09,215 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash -498710089, now seen corresponding path program 1 times [2019-09-10 06:37:09,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:09,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:37:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:37:09,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:09,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:37:09,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:37:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:37:09,274 INFO L87 Difference]: Start difference. First operand 243747 states and 303093 transitions. Second operand 4 states. [2019-09-10 06:37:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:10,517 INFO L93 Difference]: Finished difference Result 357662 states and 443845 transitions. [2019-09-10 06:37:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:10,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:37:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:10,953 INFO L225 Difference]: With dead ends: 357662 [2019-09-10 06:37:10,954 INFO L226 Difference]: Without dead ends: 357662 [2019-09-10 06:37:10,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357662 states. [2019-09-10 06:37:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357662 to 243291. [2019-09-10 06:37:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243291 states. [2019-09-10 06:37:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243291 states to 243291 states and 302558 transitions. [2019-09-10 06:37:16,223 INFO L78 Accepts]: Start accepts. Automaton has 243291 states and 302558 transitions. Word has length 111 [2019-09-10 06:37:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:16,224 INFO L475 AbstractCegarLoop]: Abstraction has 243291 states and 302558 transitions. [2019-09-10 06:37:16,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:37:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 243291 states and 302558 transitions. [2019-09-10 06:37:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:37:16,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:16,245 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:16,245 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash 767120476, now seen corresponding path program 1 times [2019-09-10 06:37:16,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:16,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:16,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:16,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:16,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:16,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:16,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:16,318 INFO L87 Difference]: Start difference. First operand 243291 states and 302558 transitions. Second operand 5 states. [2019-09-10 06:37:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:17,576 INFO L93 Difference]: Finished difference Result 291020 states and 355561 transitions. [2019-09-10 06:37:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:17,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-10 06:37:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:17,892 INFO L225 Difference]: With dead ends: 291020 [2019-09-10 06:37:17,892 INFO L226 Difference]: Without dead ends: 291020 [2019-09-10 06:37:17,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291020 states. [2019-09-10 06:37:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291020 to 235794. [2019-09-10 06:37:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235794 states. [2019-09-10 06:37:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235794 states to 235794 states and 289418 transitions. [2019-09-10 06:37:24,933 INFO L78 Accepts]: Start accepts. Automaton has 235794 states and 289418 transitions. Word has length 111 [2019-09-10 06:37:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:24,933 INFO L475 AbstractCegarLoop]: Abstraction has 235794 states and 289418 transitions. [2019-09-10 06:37:24,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 235794 states and 289418 transitions. [2019-09-10 06:37:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:37:24,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:24,953 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:24,953 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1656308014, now seen corresponding path program 1 times [2019-09-10 06:37:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:24,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:25,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:25,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:25,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:25,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:25,191 INFO L87 Difference]: Start difference. First operand 235794 states and 289418 transitions. Second operand 10 states. [2019-09-10 06:37:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:29,232 INFO L93 Difference]: Finished difference Result 646336 states and 786005 transitions. [2019-09-10 06:37:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:37:29,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:37:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:30,086 INFO L225 Difference]: With dead ends: 646336 [2019-09-10 06:37:30,086 INFO L226 Difference]: Without dead ends: 646336 [2019-09-10 06:37:30,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:37:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646336 states. [2019-09-10 06:37:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646336 to 310102. [2019-09-10 06:37:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310102 states. [2019-09-10 06:37:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310102 states to 310102 states and 380012 transitions. [2019-09-10 06:37:40,195 INFO L78 Accepts]: Start accepts. Automaton has 310102 states and 380012 transitions. Word has length 113 [2019-09-10 06:37:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:40,195 INFO L475 AbstractCegarLoop]: Abstraction has 310102 states and 380012 transitions. [2019-09-10 06:37:40,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:37:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 310102 states and 380012 transitions. [2019-09-10 06:37:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:37:40,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:40,209 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:40,210 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 733084191, now seen corresponding path program 1 times [2019-09-10 06:37:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:40,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:40,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:37:40,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:40,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:37:40,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:40,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:37:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:37:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:37:40,257 INFO L87 Difference]: Start difference. First operand 310102 states and 380012 transitions. Second operand 4 states. [2019-09-10 06:37:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:42,570 INFO L93 Difference]: Finished difference Result 459283 states and 560754 transitions. [2019-09-10 06:37:42,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:42,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:37:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:43,077 INFO L225 Difference]: With dead ends: 459283 [2019-09-10 06:37:43,077 INFO L226 Difference]: Without dead ends: 459283 [2019-09-10 06:37:43,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459283 states. [2019-09-10 06:37:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459283 to 309912. [2019-09-10 06:37:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309912 states. [2019-09-10 06:37:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309912 states to 309912 states and 379778 transitions. [2019-09-10 06:37:52,188 INFO L78 Accepts]: Start accepts. Automaton has 309912 states and 379778 transitions. Word has length 114 [2019-09-10 06:37:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:52,188 INFO L475 AbstractCegarLoop]: Abstraction has 309912 states and 379778 transitions. [2019-09-10 06:37:52,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:37:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 309912 states and 379778 transitions. [2019-09-10 06:37:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:37:52,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:52,202 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:52,202 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1369646106, now seen corresponding path program 1 times [2019-09-10 06:37:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:52,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:52,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:52,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:52,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:37:52,504 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [147], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:37:52,515 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:52,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:52,543 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:52,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:37:52,898 INFO L272 AbstractInterpreter]: Visited 109 different actions 465 times. Merged at 41 different actions 326 times. Widened at 14 different actions 51 times. Performed 1666 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 126 variables. [2019-09-10 06:37:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:52,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:37:52,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:52,898 INFO L193 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 [2019-09-10 06:37:52,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:52,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:37:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:53,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:37:53,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:37:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:53,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:53,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:37:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:37:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:37:54,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:37:54,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:37:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:37:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:37:54,092 INFO L87 Difference]: Start difference. First operand 309912 states and 379778 transitions. Second operand 22 states. [2019-09-10 06:37:57,632 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 06:38:00,908 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 06:38:01,588 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 06:38:01,933 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-09-10 06:38:02,726 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:38:03,516 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-09-10 06:38:04,205 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-09-10 06:38:04,614 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-10 06:38:04,810 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-09-10 06:38:05,375 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:38:05,580 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-10 06:38:05,765 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-10 06:38:06,308 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-09-10 06:38:06,494 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-09-10 06:38:07,115 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-10 06:38:07,289 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-10 06:38:07,541 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:38:07,712 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:38:07,920 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-10 06:38:09,140 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-10 06:38:09,541 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:38:09,704 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:38:10,140 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 06:38:10,316 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-10 06:38:10,480 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 06:38:10,654 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:38:10,991 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:38:11,439 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:38:11,597 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:38:12,659 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:38:14,229 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:38:14,559 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:38:14,946 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-10 06:38:15,113 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:38:15,276 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:38:15,953 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:38:16,329 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-10 06:38:16,510 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:38:16,709 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-09-10 06:38:17,526 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:38:17,704 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:38:18,384 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:38:18,575 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-09-10 06:38:21,527 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 06:38:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:25,238 INFO L93 Difference]: Finished difference Result 751187 states and 905412 transitions. [2019-09-10 06:38:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 06:38:25,238 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2019-09-10 06:38:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:26,134 INFO L225 Difference]: With dead ends: 751187 [2019-09-10 06:38:26,134 INFO L226 Difference]: Without dead ends: 751187 [2019-09-10 06:38:26,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8863 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=5367, Invalid=22689, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 06:38:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751187 states. [2019-09-10 06:38:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751187 to 404733. [2019-09-10 06:38:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404733 states. [2019-09-10 06:38:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404733 states to 404733 states and 494392 transitions. [2019-09-10 06:38:35,107 INFO L78 Accepts]: Start accepts. Automaton has 404733 states and 494392 transitions. Word has length 114 [2019-09-10 06:38:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:35,108 INFO L475 AbstractCegarLoop]: Abstraction has 404733 states and 494392 transitions. [2019-09-10 06:38:35,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:38:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 404733 states and 494392 transitions. [2019-09-10 06:38:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:38:35,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:35,127 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:35,128 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash -491135301, now seen corresponding path program 1 times [2019-09-10 06:38:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:35,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:35,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:35,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:35,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:35,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:38:35,343 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [335], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:38:35,350 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:35,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:35,373 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:35,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:35,732 INFO L272 AbstractInterpreter]: Visited 109 different actions 522 times. Merged at 40 different actions 380 times. Widened at 15 different actions 70 times. Performed 1856 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1856 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:38:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:35,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:35,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:35,733 INFO L193 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) [2019-09-10 06:38:35,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:35,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:35,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:38:35,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:36,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:38:36,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2019-09-10 06:38:36,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:38:36,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:38:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:38:36,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:38:36,972 INFO L87 Difference]: Start difference. First operand 404733 states and 494392 transitions. Second operand 20 states. [2019-09-10 06:38:42,508 WARN L188 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:38:43,238 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 06:38:43,712 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 06:38:44,540 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 06:38:44,706 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:38:45,189 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:38:45,469 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:38:45,899 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:38:47,401 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:38:48,422 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:38:48,843 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:38:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:50,900 INFO L93 Difference]: Finished difference Result 735209 states and 885807 transitions. [2019-09-10 06:38:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:38:50,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2019-09-10 06:38:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:51,767 INFO L225 Difference]: With dead ends: 735209 [2019-09-10 06:38:51,768 INFO L226 Difference]: Without dead ends: 735209 [2019-09-10 06:38:51,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 203 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:38:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735209 states. [2019-09-10 06:39:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735209 to 405055. [2019-09-10 06:39:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405055 states. [2019-09-10 06:39:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405055 states to 405055 states and 494791 transitions. [2019-09-10 06:39:03,780 INFO L78 Accepts]: Start accepts. Automaton has 405055 states and 494791 transitions. Word has length 114 [2019-09-10 06:39:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:03,781 INFO L475 AbstractCegarLoop]: Abstraction has 405055 states and 494791 transitions. [2019-09-10 06:39:03,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:39:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 405055 states and 494791 transitions. [2019-09-10 06:39:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:39:03,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:03,794 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:03,794 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -269638336, now seen corresponding path program 1 times [2019-09-10 06:39:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:03,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:03,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:04,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:04,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:04,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:39:04,072 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [498], [508], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:39:04,078 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:04,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:04,105 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:05,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:05,248 INFO L272 AbstractInterpreter]: Visited 109 different actions 476 times. Merged at 41 different actions 335 times. Widened at 14 different actions 50 times. Performed 1700 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:39:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:05,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:05,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:05,249 INFO L193 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) [2019-09-10 06:39:05,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:05,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:05,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:39:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:05,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:05,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:05,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:06,320 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:39:06,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:06,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:39:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:39:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:39:06,323 INFO L87 Difference]: Start difference. First operand 405055 states and 494791 transitions. Second operand 12 states. [2019-09-10 06:39:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:13,900 INFO L93 Difference]: Finished difference Result 430577 states and 524582 transitions. [2019-09-10 06:39:13,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:39:13,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-10 06:39:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:14,480 INFO L225 Difference]: With dead ends: 430577 [2019-09-10 06:39:14,481 INFO L226 Difference]: Without dead ends: 430577 [2019-09-10 06:39:14,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:39:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430577 states. [2019-09-10 06:39:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430577 to 420835. [2019-09-10 06:39:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420835 states. [2019-09-10 06:39:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420835 states to 420835 states and 513623 transitions. [2019-09-10 06:39:19,244 INFO L78 Accepts]: Start accepts. Automaton has 420835 states and 513623 transitions. Word has length 114 [2019-09-10 06:39:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:19,245 INFO L475 AbstractCegarLoop]: Abstraction has 420835 states and 513623 transitions. [2019-09-10 06:39:19,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:39:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 420835 states and 513623 transitions. [2019-09-10 06:39:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:39:19,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:19,258 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:19,258 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:19,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:19,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1287782089, now seen corresponding path program 1 times [2019-09-10 06:39:19,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:39:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:19,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:19,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:19,294 INFO L87 Difference]: Start difference. First operand 420835 states and 513623 transitions. Second operand 3 states. [2019-09-10 06:39:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:21,620 INFO L93 Difference]: Finished difference Result 466328 states and 567796 transitions. [2019-09-10 06:39:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:21,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:39:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:22,221 INFO L225 Difference]: With dead ends: 466328 [2019-09-10 06:39:22,222 INFO L226 Difference]: Without dead ends: 466328 [2019-09-10 06:39:22,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466328 states. [2019-09-10 06:39:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466328 to 389944. [2019-09-10 06:39:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389944 states. [2019-09-10 06:39:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389944 states to 389944 states and 475458 transitions. [2019-09-10 06:39:33,284 INFO L78 Accepts]: Start accepts. Automaton has 389944 states and 475458 transitions. Word has length 114 [2019-09-10 06:39:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:33,285 INFO L475 AbstractCegarLoop]: Abstraction has 389944 states and 475458 transitions. [2019-09-10 06:39:33,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 389944 states and 475458 transitions. [2019-09-10 06:39:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:39:33,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:33,295 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:33,295 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 924700564, now seen corresponding path program 1 times [2019-09-10 06:39:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:33,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:33,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:39:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:33,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:39:33,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:33,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:39:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:39:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:39:33,344 INFO L87 Difference]: Start difference. First operand 389944 states and 475458 transitions. Second operand 4 states. [2019-09-10 06:39:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:35,974 INFO L93 Difference]: Finished difference Result 747640 states and 907635 transitions. [2019-09-10 06:39:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:35,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:39:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:36,847 INFO L225 Difference]: With dead ends: 747640 [2019-09-10 06:39:36,847 INFO L226 Difference]: Without dead ends: 747640 [2019-09-10 06:39:36,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747640 states. [2019-09-10 06:39:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747640 to 418709. [2019-09-10 06:39:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418709 states. [2019-09-10 06:39:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418709 states to 418709 states and 511221 transitions. [2019-09-10 06:39:49,595 INFO L78 Accepts]: Start accepts. Automaton has 418709 states and 511221 transitions. Word has length 114 [2019-09-10 06:39:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:49,595 INFO L475 AbstractCegarLoop]: Abstraction has 418709 states and 511221 transitions. [2019-09-10 06:39:49,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:39:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 418709 states and 511221 transitions. [2019-09-10 06:39:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:39:49,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:49,605 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:49,605 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash -677769159, now seen corresponding path program 1 times [2019-09-10 06:39:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:49,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:49,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:49,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:39:49,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:49,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:39:49,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:39:49,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:39:49,871 INFO L87 Difference]: Start difference. First operand 418709 states and 511221 transitions. Second operand 12 states. [2019-09-10 06:39:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:54,726 INFO L93 Difference]: Finished difference Result 565214 states and 687067 transitions. [2019-09-10 06:39:54,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:39:54,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-10 06:39:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:55,511 INFO L225 Difference]: With dead ends: 565214 [2019-09-10 06:39:55,511 INFO L226 Difference]: Without dead ends: 565214 [2019-09-10 06:39:55,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:39:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565214 states. [2019-09-10 06:40:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565214 to 418613. [2019-09-10 06:40:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418613 states. [2019-09-10 06:40:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418613 states to 418613 states and 511117 transitions. [2019-09-10 06:40:08,257 INFO L78 Accepts]: Start accepts. Automaton has 418613 states and 511117 transitions. Word has length 114 [2019-09-10 06:40:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:08,257 INFO L475 AbstractCegarLoop]: Abstraction has 418613 states and 511117 transitions. [2019-09-10 06:40:08,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:40:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 418613 states and 511117 transitions. [2019-09-10 06:40:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:40:08,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:08,266 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:08,266 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash 755737807, now seen corresponding path program 1 times [2019-09-10 06:40:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:08,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:08,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:08,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:08,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:08,329 INFO L87 Difference]: Start difference. First operand 418613 states and 511117 transitions. Second operand 3 states. [2019-09-10 06:40:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:09,484 INFO L93 Difference]: Finished difference Result 495957 states and 603758 transitions. [2019-09-10 06:40:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:09,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:40:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:16,357 INFO L225 Difference]: With dead ends: 495957 [2019-09-10 06:40:16,358 INFO L226 Difference]: Without dead ends: 495957 [2019-09-10 06:40:16,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495957 states. [2019-09-10 06:40:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495957 to 432755. [2019-09-10 06:40:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432755 states. [2019-09-10 06:40:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432755 states to 432755 states and 526974 transitions. [2019-09-10 06:40:21,182 INFO L78 Accepts]: Start accepts. Automaton has 432755 states and 526974 transitions. Word has length 115 [2019-09-10 06:40:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:21,182 INFO L475 AbstractCegarLoop]: Abstraction has 432755 states and 526974 transitions. [2019-09-10 06:40:21,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:40:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 432755 states and 526974 transitions. [2019-09-10 06:40:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:40:21,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:21,191 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:21,191 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1216452885, now seen corresponding path program 1 times [2019-09-10 06:40:21,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:21,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:21,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:21,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:21,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:21,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:40:21,598 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [333], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:40:21,605 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:21,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:21,623 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:21,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:21,916 INFO L272 AbstractInterpreter]: Visited 110 different actions 558 times. Merged at 41 different actions 414 times. Widened at 16 different actions 77 times. Performed 1976 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 126 variables. [2019-09-10 06:40:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:21,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:21,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:21,917 INFO L193 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) [2019-09-10 06:40:21,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:21,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:40:22,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:25,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:25,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:25,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 30 [2019-09-10 06:40:25,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:25,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:40:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:40:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=766, Unknown=1, NotChecked=0, Total=870 [2019-09-10 06:40:25,862 INFO L87 Difference]: Start difference. First operand 432755 states and 526974 transitions. Second operand 24 states. [2019-09-10 06:40:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:35,923 INFO L93 Difference]: Finished difference Result 834511 states and 1006855 transitions. [2019-09-10 06:40:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:40:35,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 115 [2019-09-10 06:40:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:36,972 INFO L225 Difference]: With dead ends: 834511 [2019-09-10 06:40:36,972 INFO L226 Difference]: Without dead ends: 834511 [2019-09-10 06:40:36,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=368, Invalid=1701, Unknown=1, NotChecked=0, Total=2070 [2019-09-10 06:40:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834511 states. [2019-09-10 06:40:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834511 to 432785. [2019-09-10 06:40:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432785 states. [2019-09-10 06:40:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432785 states to 432785 states and 527004 transitions. [2019-09-10 06:40:46,129 INFO L78 Accepts]: Start accepts. Automaton has 432785 states and 527004 transitions. Word has length 115 [2019-09-10 06:40:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:46,129 INFO L475 AbstractCegarLoop]: Abstraction has 432785 states and 527004 transitions. [2019-09-10 06:40:46,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:40:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 432785 states and 527004 transitions. [2019-09-10 06:40:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:40:46,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:46,138 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:46,138 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2009447844, now seen corresponding path program 1 times [2019-09-10 06:40:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:46,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:40:46,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:46,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:40:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:40:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:40:46,499 INFO L87 Difference]: Start difference. First operand 432785 states and 527004 transitions. Second operand 15 states. [2019-09-10 06:40:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:54,850 INFO L93 Difference]: Finished difference Result 566157 states and 687934 transitions. [2019-09-10 06:40:54,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:40:54,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-09-10 06:40:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:55,553 INFO L225 Difference]: With dead ends: 566157 [2019-09-10 06:40:55,553 INFO L226 Difference]: Without dead ends: 566157 [2019-09-10 06:40:55,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=400, Invalid=1006, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:40:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566157 states. [2019-09-10 06:41:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566157 to 458822. [2019-09-10 06:41:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458822 states. [2019-09-10 06:41:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458822 states to 458822 states and 558570 transitions. [2019-09-10 06:41:01,144 INFO L78 Accepts]: Start accepts. Automaton has 458822 states and 558570 transitions. Word has length 115 [2019-09-10 06:41:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:01,144 INFO L475 AbstractCegarLoop]: Abstraction has 458822 states and 558570 transitions. [2019-09-10 06:41:01,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:41:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 458822 states and 558570 transitions. [2019-09-10 06:41:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:41:01,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:01,152 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:01,152 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -243729482, now seen corresponding path program 1 times [2019-09-10 06:41:01,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:01,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:01,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:01,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:01,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:01,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:41:01,610 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [498], [508], [513], [518], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:41:01,613 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:01,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:01,635 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:01,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:01,873 INFO L272 AbstractInterpreter]: Visited 110 different actions 459 times. Merged at 41 different actions 317 times. Widened at 14 different actions 46 times. Performed 1671 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1671 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:41:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:01,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:01,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:01,874 INFO L193 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) [2019-09-10 06:41:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:01,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:02,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:41:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:03,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:03,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:03,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:03,965 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 06:41:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:04,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:41:04,465 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:41:04,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [17] total 32 [2019-09-10 06:41:04,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:04,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:41:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:41:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:41:04,471 INFO L87 Difference]: Start difference. First operand 458822 states and 558570 transitions. Second operand 12 states. [2019-09-10 06:41:07,185 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 06:41:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:09,068 INFO L93 Difference]: Finished difference Result 522951 states and 634730 transitions. [2019-09-10 06:41:09,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:41:09,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-09-10 06:41:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:16,557 INFO L225 Difference]: With dead ends: 522951 [2019-09-10 06:41:16,557 INFO L226 Difference]: Without dead ends: 522951 [2019-09-10 06:41:16,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 212 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=323, Invalid=2433, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:41:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522951 states. [2019-09-10 06:41:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522951 to 470700. [2019-09-10 06:41:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470700 states. [2019-09-10 06:41:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470700 states to 470700 states and 572892 transitions. [2019-09-10 06:41:22,489 INFO L78 Accepts]: Start accepts. Automaton has 470700 states and 572892 transitions. Word has length 115 [2019-09-10 06:41:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:22,489 INFO L475 AbstractCegarLoop]: Abstraction has 470700 states and 572892 transitions. [2019-09-10 06:41:22,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:41:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 470700 states and 572892 transitions. [2019-09-10 06:41:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:41:22,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:22,500 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:22,500 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -238911434, now seen corresponding path program 1 times [2019-09-10 06:41:22,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:22,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:22,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:22,550 INFO L87 Difference]: Start difference. First operand 470700 states and 572892 transitions. Second operand 3 states. [2019-09-10 06:41:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:23,824 INFO L93 Difference]: Finished difference Result 558093 states and 674567 transitions. [2019-09-10 06:41:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:23,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:41:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:24,473 INFO L225 Difference]: With dead ends: 558093 [2019-09-10 06:41:24,473 INFO L226 Difference]: Without dead ends: 558093 [2019-09-10 06:41:24,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558093 states. [2019-09-10 06:41:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558093 to 464676. [2019-09-10 06:41:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464676 states. [2019-09-10 06:41:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464676 states to 464676 states and 562327 transitions. [2019-09-10 06:41:37,502 INFO L78 Accepts]: Start accepts. Automaton has 464676 states and 562327 transitions. Word has length 115 [2019-09-10 06:41:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:37,503 INFO L475 AbstractCegarLoop]: Abstraction has 464676 states and 562327 transitions. [2019-09-10 06:41:37,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 464676 states and 562327 transitions. [2019-09-10 06:41:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:41:37,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:37,512 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:37,512 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:37,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1116774600, now seen corresponding path program 1 times [2019-09-10 06:41:37,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:38,781 WARN L188 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-09-10 06:41:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:38,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:38,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:38,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:41:38,810 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [510], [520], [573], [589], [611], [612], [616], [617], [618] [2019-09-10 06:41:38,812 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:38,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:38,823 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:39,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:39,014 INFO L272 AbstractInterpreter]: Visited 110 different actions 459 times. Merged at 41 different actions 321 times. Widened at 14 different actions 45 times. Performed 1556 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 126 variables. [2019-09-10 06:41:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:39,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:39,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:39,014 INFO L193 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) [2019-09-10 06:41:39,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:39,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:39,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:41:39,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:39,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:39,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:40,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:40,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2019-09-10 06:41:40,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:40,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:41:40,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:41:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:41:40,033 INFO L87 Difference]: Start difference. First operand 464676 states and 562327 transitions. Second operand 26 states. [2019-09-10 06:41:41,953 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-09-10 06:41:43,626 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-09-10 06:41:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:46,069 INFO L93 Difference]: Finished difference Result 751232 states and 899641 transitions. [2019-09-10 06:41:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:41:46,070 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 115 [2019-09-10 06:41:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:48,035 INFO L225 Difference]: With dead ends: 751232 [2019-09-10 06:41:48,035 INFO L226 Difference]: Without dead ends: 751232 [2019-09-10 06:41:48,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:41:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751232 states. [2019-09-10 06:42:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751232 to 498058. [2019-09-10 06:42:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498058 states. [2019-09-10 06:42:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498058 states to 498058 states and 601873 transitions. [2019-09-10 06:42:02,640 INFO L78 Accepts]: Start accepts. Automaton has 498058 states and 601873 transitions. Word has length 115 [2019-09-10 06:42:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:02,640 INFO L475 AbstractCegarLoop]: Abstraction has 498058 states and 601873 transitions. [2019-09-10 06:42:02,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:42:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 498058 states and 601873 transitions. [2019-09-10 06:42:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:02,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:02,651 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:02,651 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1780759166, now seen corresponding path program 1 times [2019-09-10 06:42:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:02,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:02,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:03,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:03,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:03,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:42:03,150 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [384], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:42:03,152 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:03,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:03,170 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:03,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:03,507 INFO L272 AbstractInterpreter]: Visited 111 different actions 434 times. Merged at 42 different actions 299 times. Widened at 13 different actions 37 times. Performed 1571 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 9 different actions. Largest state had 126 variables. [2019-09-10 06:42:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:03,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:03,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:03,508 INFO L193 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 [2019-09-10 06:42:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:03,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:03,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:42:03,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:03,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:06,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:42:06,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:42:06,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:42:06,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:42:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:06,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2019-09-10 06:42:06,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:06,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:42:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:42:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:42:06,416 INFO L87 Difference]: Start difference. First operand 498058 states and 601873 transitions. Second operand 26 states. [2019-09-10 06:42:08,495 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 38 [2019-09-10 06:42:08,865 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 35 [2019-09-10 06:42:09,652 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-09-10 06:42:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:16,516 INFO L93 Difference]: Finished difference Result 908147 states and 1091235 transitions. [2019-09-10 06:42:16,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:42:16,516 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 116 [2019-09-10 06:42:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:17,765 INFO L225 Difference]: With dead ends: 908147 [2019-09-10 06:42:17,765 INFO L226 Difference]: Without dead ends: 908147 [2019-09-10 06:42:17,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 200 SyntacticMatches, 20 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=542, Invalid=2764, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:42:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908147 states. [2019-09-10 06:42:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908147 to 498064. [2019-09-10 06:42:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498064 states. [2019-09-10 06:42:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498064 states to 498064 states and 601879 transitions. [2019-09-10 06:42:33,806 INFO L78 Accepts]: Start accepts. Automaton has 498064 states and 601879 transitions. Word has length 116 [2019-09-10 06:42:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:33,806 INFO L475 AbstractCegarLoop]: Abstraction has 498064 states and 601879 transitions. [2019-09-10 06:42:33,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:42:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 498064 states and 601879 transitions. [2019-09-10 06:42:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:33,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:33,816 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:33,816 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1193953152, now seen corresponding path program 1 times [2019-09-10 06:42:33,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:33,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:42:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:42:34,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:34,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:42:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:42:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:42:34,193 INFO L87 Difference]: Start difference. First operand 498064 states and 601879 transitions. Second operand 11 states. [2019-09-10 06:42:34,403 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 06:42:34,532 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:42:34,668 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:42:34,807 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:42:35,110 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:42:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:40,058 INFO L93 Difference]: Finished difference Result 963010 states and 1162513 transitions. [2019-09-10 06:42:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:42:40,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-10 06:42:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:41,308 INFO L225 Difference]: With dead ends: 963010 [2019-09-10 06:42:41,309 INFO L226 Difference]: Without dead ends: 963010 [2019-09-10 06:42:41,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:42:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963010 states. [2019-09-10 06:42:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963010 to 497878. [2019-09-10 06:42:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497878 states. [2019-09-10 06:42:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497878 states to 497878 states and 601674 transitions. [2019-09-10 06:42:57,081 INFO L78 Accepts]: Start accepts. Automaton has 497878 states and 601674 transitions. Word has length 116 [2019-09-10 06:42:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:57,081 INFO L475 AbstractCegarLoop]: Abstraction has 497878 states and 601674 transitions. [2019-09-10 06:42:57,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:42:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 497878 states and 601674 transitions. [2019-09-10 06:42:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:57,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:57,090 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:57,090 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1248346050, now seen corresponding path program 1 times [2019-09-10 06:42:57,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:57,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:57,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:57,581 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-09-10 06:42:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:58,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:58,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:42:58,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:58,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:42:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:42:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:42:58,733 INFO L87 Difference]: Start difference. First operand 497878 states and 601674 transitions. Second operand 21 states. [2019-09-10 06:43:01,028 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:43:01,300 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 06:43:01,546 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:43:01,879 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:43:02,135 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:43:02,677 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:43:02,831 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:43:03,097 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:43:03,511 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:43:03,795 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 06:43:03,970 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:43:04,210 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 06:43:05,128 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:43:05,501 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:43:05,926 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:43:06,248 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-09-10 06:43:06,637 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:43:07,038 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:43:07,606 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:43:08,454 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:43:08,795 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-09-10 06:43:10,256 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:43:10,654 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:43:10,913 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:43:11,182 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 06:43:11,784 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:43:12,291 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:43:12,592 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-10 06:43:12,860 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:43:13,175 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:43:13,443 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 06:43:13,755 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:43:14,261 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:43:14,559 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-10 06:43:14,815 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:43:15,198 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:43:15,460 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 06:43:15,709 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 06:43:15,961 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:43:16,206 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 06:43:16,569 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:43:16,931 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 06:43:17,313 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:43:18,471 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 06:43:18,686 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:43:18,903 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:43:19,275 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:43:19,613 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:43:19,836 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:43:20,059 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:43:20,458 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:43:20,840 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:43:21,211 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:43:21,454 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:43:21,787 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:43:22,175 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:43:22,508 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:43:22,838 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:43:23,187 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:43:23,565 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:43:23,697 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:43:24,058 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:43:24,492 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:43:24,920 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:43:25,193 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 06:43:25,435 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:43:25,733 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 06:43:25,979 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:43:26,822 WARN L188 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:43:27,137 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 06:43:27,507 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:43:27,850 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:43:28,404 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:43:28,742 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 06:43:29,306 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:43:29,618 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:43:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:31,795 INFO L93 Difference]: Finished difference Result 973142 states and 1172121 transitions. [2019-09-10 06:43:31,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-10 06:43:31,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2019-09-10 06:43:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:33,018 INFO L225 Difference]: With dead ends: 973142 [2019-09-10 06:43:33,019 INFO L226 Difference]: Without dead ends: 973142 [2019-09-10 06:43:33,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=1926, Invalid=10064, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 06:43:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973142 states. [2019-09-10 06:43:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973142 to 506370. [2019-09-10 06:43:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506370 states. [2019-09-10 06:43:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506370 states to 506370 states and 611793 transitions. [2019-09-10 06:43:50,072 INFO L78 Accepts]: Start accepts. Automaton has 506370 states and 611793 transitions. Word has length 116 [2019-09-10 06:43:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:50,072 INFO L475 AbstractCegarLoop]: Abstraction has 506370 states and 611793 transitions. [2019-09-10 06:43:50,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:43:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 506370 states and 611793 transitions. [2019-09-10 06:43:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:43:50,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:50,081 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:50,081 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 32418267, now seen corresponding path program 1 times [2019-09-10 06:43:50,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:50,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:50,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:50,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:43:50,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:50,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:43:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:43:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:43:50,141 INFO L87 Difference]: Start difference. First operand 506370 states and 611793 transitions. Second operand 3 states. [2019-09-10 06:43:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:50,984 INFO L93 Difference]: Finished difference Result 374899 states and 439192 transitions. [2019-09-10 06:43:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:43:50,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:43:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:51,416 INFO L225 Difference]: With dead ends: 374899 [2019-09-10 06:43:51,416 INFO L226 Difference]: Without dead ends: 374899 [2019-09-10 06:43:51,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:43:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374899 states. [2019-09-10 06:44:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374899 to 354852. [2019-09-10 06:44:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354852 states. [2019-09-10 06:44:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354852 states to 354852 states and 418437 transitions. [2019-09-10 06:44:05,135 INFO L78 Accepts]: Start accepts. Automaton has 354852 states and 418437 transitions. Word has length 116 [2019-09-10 06:44:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:05,135 INFO L475 AbstractCegarLoop]: Abstraction has 354852 states and 418437 transitions. [2019-09-10 06:44:05,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 354852 states and 418437 transitions. [2019-09-10 06:44:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:44:05,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:05,142 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:05,142 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1403747042, now seen corresponding path program 1 times [2019-09-10 06:44:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:05,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:44:05,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:05,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:44:05,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:05,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:44:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:44:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:44:05,689 INFO L87 Difference]: Start difference. First operand 354852 states and 418437 transitions. Second operand 12 states. [2019-09-10 06:44:06,225 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:44:06,431 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:44:06,644 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 06:44:06,862 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:44:07,082 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:44:07,327 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:44:07,543 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:44:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:09,315 INFO L93 Difference]: Finished difference Result 467329 states and 551922 transitions. [2019-09-10 06:44:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:44:09,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 06:44:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:09,886 INFO L225 Difference]: With dead ends: 467329 [2019-09-10 06:44:09,886 INFO L226 Difference]: Without dead ends: 467329 [2019-09-10 06:44:09,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:44:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467329 states. [2019-09-10 06:44:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467329 to 335215. [2019-09-10 06:44:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335215 states. [2019-09-10 06:44:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335215 states to 335215 states and 395285 transitions. [2019-09-10 06:44:14,940 INFO L78 Accepts]: Start accepts. Automaton has 335215 states and 395285 transitions. Word has length 116 [2019-09-10 06:44:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:14,941 INFO L475 AbstractCegarLoop]: Abstraction has 335215 states and 395285 transitions. [2019-09-10 06:44:14,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:44:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 335215 states and 395285 transitions. [2019-09-10 06:44:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:44:14,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:14,946 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:14,946 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 882679816, now seen corresponding path program 1 times [2019-09-10 06:44:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:14,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:14,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:16,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:16,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:16,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:44:16,704 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [489], [494], [510], [520], [573], [589], [611], [612], [616], [617], [618] [2019-09-10 06:44:16,705 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:16,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:16,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:16,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:16,948 INFO L272 AbstractInterpreter]: Visited 111 different actions 504 times. Merged at 41 different actions 361 times. Widened at 12 different actions 53 times. Performed 1740 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1740 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 14 different actions. Largest state had 126 variables. [2019-09-10 06:44:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:16,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:16,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:16,948 INFO L193 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) [2019-09-10 06:44:16,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:16,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:44:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:17,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:44:17,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:17,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:18,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:18,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:18,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:18,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:44:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 38 [2019-09-10 06:44:18,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:44:18,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:44:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:44:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:44:18,467 INFO L87 Difference]: Start difference. First operand 335215 states and 395285 transitions. Second operand 28 states. [2019-09-10 06:44:19,833 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:44:20,043 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:44:20,396 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:44:20,645 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 06:44:20,910 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 06:44:21,141 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:44:21,433 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 06:44:21,699 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 06:44:22,064 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-09-10 06:44:23,447 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-09-10 06:44:23,862 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:44:24,188 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 06:44:24,536 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:44:24,792 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 06:44:25,192 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 06:44:25,588 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 06:44:26,143 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 06:44:26,608 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-09-10 06:44:27,052 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-09-10 06:44:27,617 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-09-10 06:44:28,384 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-09-10 06:44:30,943 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2019-09-10 06:44:31,723 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-09-10 06:44:32,444 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2019-09-10 06:44:32,955 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 06:44:33,565 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2019-09-10 06:44:33,952 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-09-10 06:44:34,557 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 123 [2019-09-10 06:44:34,886 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 06:44:35,108 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:44:35,500 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 06:44:35,832 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 06:44:36,207 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 06:44:36,732 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-09-10 06:44:37,209 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-09-10 06:44:37,570 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 06:44:38,436 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-09-10 06:44:39,098 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2019-09-10 06:44:39,453 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 06:44:39,929 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:44:40,288 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 06:44:40,579 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 06:44:40,847 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 06:44:41,585 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:44:41,992 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 06:44:42,530 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-09-10 06:44:43,100 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2019-09-10 06:44:43,596 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:44:44,118 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 06:44:44,618 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 06:44:45,235 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:44:45,797 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2019-09-10 06:44:46,118 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-10 06:44:46,394 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:44:47,169 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 06:44:47,880 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:44:48,431 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:44:48,734 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 06:44:49,124 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 06:44:49,456 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:44:49,960 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-10 06:44:50,542 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-09-10 06:44:51,043 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-09-10 06:44:51,410 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:44:51,878 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 06:44:52,200 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-09-10 06:44:52,622 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:44:53,050 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-09-10 06:44:53,677 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 06:44:54,082 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 06:44:54,416 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:44:54,765 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 06:44:55,170 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-09-10 06:44:55,590 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 06:44:56,091 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 06:44:57,044 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-09-10 06:44:57,564 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-09-10 06:44:58,032 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 06:44:58,552 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2019-09-10 06:44:59,078 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2019-09-10 06:44:59,913 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-09-10 06:45:00,652 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2019-09-10 06:45:00,949 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:45:01,515 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 06:45:01,993 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 06:45:02,489 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-09-10 06:45:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:03,741 INFO L93 Difference]: Finished difference Result 460362 states and 542375 transitions. [2019-09-10 06:45:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-10 06:45:03,741 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 116 [2019-09-10 06:45:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:04,313 INFO L225 Difference]: With dead ends: 460362 [2019-09-10 06:45:04,314 INFO L226 Difference]: Without dead ends: 460362 [2019-09-10 06:45:04,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=3324, Invalid=15036, Unknown=0, NotChecked=0, Total=18360 [2019-09-10 06:45:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460362 states. [2019-09-10 06:45:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460362 to 316425. [2019-09-10 06:45:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316425 states. [2019-09-10 06:45:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316425 states to 316425 states and 373088 transitions. [2019-09-10 06:45:09,908 INFO L78 Accepts]: Start accepts. Automaton has 316425 states and 373088 transitions. Word has length 116 [2019-09-10 06:45:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:09,908 INFO L475 AbstractCegarLoop]: Abstraction has 316425 states and 373088 transitions. [2019-09-10 06:45:09,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:45:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 316425 states and 373088 transitions. [2019-09-10 06:45:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:45:09,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:09,914 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:09,914 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1930221503, now seen corresponding path program 1 times [2019-09-10 06:45:09,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:09,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:09,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:10,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:10,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:10,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:45:10,241 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [611], [612], [616], [617], [618] [2019-09-10 06:45:10,243 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:10,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:10,256 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:10,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:10,468 INFO L272 AbstractInterpreter]: Visited 113 different actions 456 times. Merged at 40 different actions 311 times. Widened at 14 different actions 49 times. Performed 1650 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 13 different actions. Largest state had 127 variables. [2019-09-10 06:45:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:10,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:10,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:10,469 INFO L193 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) [2019-09-10 06:45:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:10,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:10,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:45:10,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:10,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:11,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:11,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:13,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:13,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:45:13,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:13,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:45:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:45:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:45:13,765 INFO L87 Difference]: Start difference. First operand 316425 states and 373088 transitions. Second operand 20 states. [2019-09-10 06:45:14,004 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:45:14,921 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:45:15,663 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:45:16,258 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:17,402 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:17,914 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:18,625 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:45:18,932 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:19,261 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:20,050 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:20,296 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:45:21,784 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:45:22,210 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:45:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:28,340 INFO L93 Difference]: Finished difference Result 515099 states and 605324 transitions. [2019-09-10 06:45:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:45:28,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 118 [2019-09-10 06:45:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:28,914 INFO L225 Difference]: With dead ends: 515099 [2019-09-10 06:45:28,914 INFO L226 Difference]: Without dead ends: 515099 [2019-09-10 06:45:28,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 188 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=414, Invalid=1308, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:45:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515099 states. [2019-09-10 06:45:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515099 to 316492. [2019-09-10 06:45:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316492 states. [2019-09-10 06:45:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316492 states to 316492 states and 373156 transitions. [2019-09-10 06:45:32,803 INFO L78 Accepts]: Start accepts. Automaton has 316492 states and 373156 transitions. Word has length 118 [2019-09-10 06:45:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:32,803 INFO L475 AbstractCegarLoop]: Abstraction has 316492 states and 373156 transitions. [2019-09-10 06:45:32,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:45:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 316492 states and 373156 transitions. [2019-09-10 06:45:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:45:32,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:32,809 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:32,809 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1451703790, now seen corresponding path program 1 times [2019-09-10 06:45:32,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:32,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:32,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:32,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:45:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:32,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:32,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:32,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:32,885 INFO L87 Difference]: Start difference. First operand 316492 states and 373156 transitions. Second operand 5 states. [2019-09-10 06:45:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:33,784 INFO L93 Difference]: Finished difference Result 334713 states and 392313 transitions. [2019-09-10 06:45:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:45:33,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-10 06:45:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:34,142 INFO L225 Difference]: With dead ends: 334713 [2019-09-10 06:45:34,142 INFO L226 Difference]: Without dead ends: 334713 [2019-09-10 06:45:34,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334713 states. [2019-09-10 06:45:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334713 to 315609. [2019-09-10 06:45:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315609 states. [2019-09-10 06:45:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315609 states to 315609 states and 372156 transitions. [2019-09-10 06:45:38,707 INFO L78 Accepts]: Start accepts. Automaton has 315609 states and 372156 transitions. Word has length 118 [2019-09-10 06:45:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:38,708 INFO L475 AbstractCegarLoop]: Abstraction has 315609 states and 372156 transitions. [2019-09-10 06:45:38,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 315609 states and 372156 transitions. [2019-09-10 06:45:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:45:38,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:38,713 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:38,713 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1119176427, now seen corresponding path program 1 times [2019-09-10 06:45:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:38,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:39,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:39,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:39,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 06:45:39,287 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [513], [518], [611], [612], [616], [617], [618] [2019-09-10 06:45:39,289 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:39,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:39,302 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:39,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:39,517 INFO L272 AbstractInterpreter]: Visited 114 different actions 481 times. Merged at 40 different actions 333 times. Widened at 14 different actions 53 times. Performed 1682 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1682 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 127 variables. [2019-09-10 06:45:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:39,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:39,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:39,518 INFO L193 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) [2019-09-10 06:45:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:39,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:39,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:45:39,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:39,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:41,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:42,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:42,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:42,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:57,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13] total 38 [2019-09-10 06:45:57,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:57,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:45:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:45:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1285, Unknown=1, NotChecked=0, Total=1406 [2019-09-10 06:45:57,586 INFO L87 Difference]: Start difference. First operand 315609 states and 372156 transitions. Second operand 31 states. [2019-09-10 06:45:58,028 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 06:45:58,590 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:45:59,179 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 06:45:59,639 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 06:46:00,154 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:46:00,382 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:46:00,851 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:46:01,085 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:46:01,368 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:46:01,732 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:46:01,907 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 06:46:02,107 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:46:02,458 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:46:02,681 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:46:02,944 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:46:03,424 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:46:03,615 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 06:46:03,753 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:46:03,978 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:46:04,189 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:46:04,571 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:46:04,709 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:46:04,944 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:46:05,176 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:46:05,366 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 06:46:05,620 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:46:05,894 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 06:46:06,372 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 06:46:06,646 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:46:06,974 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 06:46:07,217 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 06:46:07,454 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:46:07,845 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:46:08,110 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:46:08,344 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 06:46:08,611 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:46:08,796 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:46:09,121 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 06:46:09,615 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 06:46:09,808 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:46:10,120 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70