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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:45:35,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:45:35,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:45:35,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:45:35,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:45:35,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:45:35,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:45:35,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:45:35,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:45:35,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:45:35,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:45:35,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:45:35,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:45:35,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:45:35,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:45:35,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:45:35,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:45:35,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:45:35,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:45:35,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:45:35,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:45:35,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:45:35,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:45:35,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:45:35,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:45:35,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:45:35,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:45:35,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:45:35,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:45:35,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:45:35,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:45:35,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:45:35,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:45:35,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:45:35,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:45:35,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:45:35,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:45:35,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:45:35,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:45:35,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:45:35,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:45:35,655 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:45:35,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:45:35,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:45:35,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:45:35,672 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:45:35,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:45:35,673 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:45:35,673 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:45:35,673 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:45:35,674 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:45:35,674 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:45:35,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:45:35,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:45:35,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:45:35,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:45:35,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:45:35,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:45:35,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:45:35,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:45:35,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:45:35,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:45:35,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:45:35,677 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:45:35,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:45:35,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:45:35,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:45:35,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:45:35,678 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:45:35,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:45:35,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:45:35,678 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:45:35,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:45:35,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:45:35,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:45:35,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:45:35,735 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:45:35,736 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:45:35,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f613913/3c8f38272cec46c4bd7aed4b905a0db6/FLAGa52a63917 [2019-09-10 06:45:36,408 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:45:36,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:45:36,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f613913/3c8f38272cec46c4bd7aed4b905a0db6/FLAGa52a63917 [2019-09-10 06:45:36,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f613913/3c8f38272cec46c4bd7aed4b905a0db6 [2019-09-10 06:45:36,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:45:36,603 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:45:36,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:45:36,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:45:36,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:45:36,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:45:36" (1/1) ... [2019-09-10 06:45:36,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bd581c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:36, skipping insertion in model container [2019-09-10 06:45:36,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:45:36" (1/1) ... [2019-09-10 06:45:36,620 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:45:36,715 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:45:37,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:45:37,463 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:45:37,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:45:37,856 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:45:37,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37 WrapperNode [2019-09-10 06:45:37,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:45:37,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:45:37,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:45:37,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:45:37,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (1/1) ... [2019-09-10 06:45:37,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:45:37,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:45:37,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:45:37,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:45:37,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (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:45:38,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:45:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:45:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:45:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:45:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:45:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:45:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:45:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:45:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:45:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:45:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:45:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:45:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:45:40,027 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:45:40,028 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:45:40,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:45:40 BoogieIcfgContainer [2019-09-10 06:45:40,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:45:40,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:45:40,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:45:40,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:45:40,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:45:36" (1/3) ... [2019-09-10 06:45:40,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd6faa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:45:40, skipping insertion in model container [2019-09-10 06:45:40,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:37" (2/3) ... [2019-09-10 06:45:40,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd6faa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:45:40, skipping insertion in model container [2019-09-10 06:45:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:45:40" (3/3) ... [2019-09-10 06:45:40,043 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:45:40,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:45:40,075 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-10 06:45:40,093 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-10 06:45:40,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:45:40,128 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:45:40,128 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:45:40,128 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:45:40,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:45:40,128 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:45:40,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:45:40,129 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:45:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-09-10 06:45:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:45:40,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:40,212 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] [2019-09-10 06:45:40,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash 612696190, now seen corresponding path program 1 times [2019-09-10 06:45:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:40,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:40,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:40,783 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:45:40,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:40,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:40,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:40,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:40,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:40,810 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 5 states. [2019-09-10 06:45:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:41,414 INFO L93 Difference]: Finished difference Result 501 states and 859 transitions. [2019-09-10 06:45:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:41,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 06:45:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:41,433 INFO L225 Difference]: With dead ends: 501 [2019-09-10 06:45:41,434 INFO L226 Difference]: Without dead ends: 489 [2019-09-10 06:45:41,436 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:45:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-10 06:45:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2019-09-10 06:45:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-10 06:45:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 653 transitions. [2019-09-10 06:45:41,513 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 653 transitions. Word has length 55 [2019-09-10 06:45:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:41,514 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 653 transitions. [2019-09-10 06:45:41,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 653 transitions. [2019-09-10 06:45:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:45:41,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:41,521 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] [2019-09-10 06:45:41,521 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1659380668, now seen corresponding path program 1 times [2019-09-10 06:45:41,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:41,702 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:45:41,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:41,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:41,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:41,759 INFO L87 Difference]: Start difference. First operand 483 states and 653 transitions. Second operand 3 states. [2019-09-10 06:45:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:41,806 INFO L93 Difference]: Finished difference Result 662 states and 881 transitions. [2019-09-10 06:45:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:41,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:45:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:41,810 INFO L225 Difference]: With dead ends: 662 [2019-09-10 06:45:41,811 INFO L226 Difference]: Without dead ends: 662 [2019-09-10 06:45:41,812 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:45:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-10 06:45:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 654. [2019-09-10 06:45:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-10 06:45:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 875 transitions. [2019-09-10 06:45:41,843 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 875 transitions. Word has length 56 [2019-09-10 06:45:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:41,844 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 875 transitions. [2019-09-10 06:45:41,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 875 transitions. [2019-09-10 06:45:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:45:41,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:41,846 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] [2019-09-10 06:45:41,847 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 438922513, now seen corresponding path program 1 times [2019-09-10 06:45:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:41,949 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:45:41,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:41,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:41,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:41,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:41,952 INFO L87 Difference]: Start difference. First operand 654 states and 875 transitions. Second operand 3 states. [2019-09-10 06:45:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:41,991 INFO L93 Difference]: Finished difference Result 918 states and 1245 transitions. [2019-09-10 06:45:41,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:41,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:45:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:41,997 INFO L225 Difference]: With dead ends: 918 [2019-09-10 06:45:41,998 INFO L226 Difference]: Without dead ends: 918 [2019-09-10 06:45:41,998 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:45:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-10 06:45:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2019-09-10 06:45:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 06:45:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1241 transitions. [2019-09-10 06:45:42,025 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1241 transitions. Word has length 56 [2019-09-10 06:45:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:42,026 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1241 transitions. [2019-09-10 06:45:42,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1241 transitions. [2019-09-10 06:45:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:45:42,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:42,029 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] [2019-09-10 06:45:42,029 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2011379690, now seen corresponding path program 1 times [2019-09-10 06:45:42,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:42,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:42,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:42,162 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:45:42,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:45:42,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:42,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:45:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:45:42,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:45:42,164 INFO L87 Difference]: Start difference. First operand 912 states and 1241 transitions. Second operand 6 states. [2019-09-10 06:45:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:42,587 INFO L93 Difference]: Finished difference Result 1493 states and 2083 transitions. [2019-09-10 06:45:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:42,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:45:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:42,595 INFO L225 Difference]: With dead ends: 1493 [2019-09-10 06:45:42,596 INFO L226 Difference]: Without dead ends: 1493 [2019-09-10 06:45:42,596 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:45:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-10 06:45:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1475. [2019-09-10 06:45:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-09-10 06:45:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2069 transitions. [2019-09-10 06:45:42,636 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2069 transitions. Word has length 56 [2019-09-10 06:45:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:42,636 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 2069 transitions. [2019-09-10 06:45:42,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:45:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2069 transitions. [2019-09-10 06:45:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:45:42,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:42,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] [2019-09-10 06:45:42,639 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1500009087, now seen corresponding path program 1 times [2019-09-10 06:45:42,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:42,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:42,745 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:45:42,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:42,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:45:42,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:42,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:45:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:45:42,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:45:42,747 INFO L87 Difference]: Start difference. First operand 1475 states and 2069 transitions. Second operand 6 states. [2019-09-10 06:45:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:43,163 INFO L93 Difference]: Finished difference Result 3329 states and 4684 transitions. [2019-09-10 06:45:43,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:43,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:45:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:43,179 INFO L225 Difference]: With dead ends: 3329 [2019-09-10 06:45:43,179 INFO L226 Difference]: Without dead ends: 3329 [2019-09-10 06:45:43,180 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:45:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2019-09-10 06:45:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3314. [2019-09-10 06:45:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3314 states. [2019-09-10 06:45:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4673 transitions. [2019-09-10 06:45:43,252 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4673 transitions. Word has length 57 [2019-09-10 06:45:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:43,253 INFO L475 AbstractCegarLoop]: Abstraction has 3314 states and 4673 transitions. [2019-09-10 06:45:43,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:45:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4673 transitions. [2019-09-10 06:45:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:45:43,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:43,255 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:45:43,256 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1393968156, now seen corresponding path program 1 times [2019-09-10 06:45:43,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:43,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:43,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:43,326 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:45:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:43,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:43,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:43,328 INFO L87 Difference]: Start difference. First operand 3314 states and 4673 transitions. Second operand 3 states. [2019-09-10 06:45:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:43,404 INFO L93 Difference]: Finished difference Result 4772 states and 6658 transitions. [2019-09-10 06:45:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:43,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:45:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:43,425 INFO L225 Difference]: With dead ends: 4772 [2019-09-10 06:45:43,425 INFO L226 Difference]: Without dead ends: 4772 [2019-09-10 06:45:43,426 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:45:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-09-10 06:45:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4735. [2019-09-10 06:45:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4735 states. [2019-09-10 06:45:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 6623 transitions. [2019-09-10 06:45:43,531 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 6623 transitions. Word has length 57 [2019-09-10 06:45:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:43,532 INFO L475 AbstractCegarLoop]: Abstraction has 4735 states and 6623 transitions. [2019-09-10 06:45:43,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 6623 transitions. [2019-09-10 06:45:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:45:43,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:43,535 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:45:43,535 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash 605372369, now seen corresponding path program 1 times [2019-09-10 06:45:43,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:43,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:43,707 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:45:43,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:45:43,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:43,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:45:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:45:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:45:43,709 INFO L87 Difference]: Start difference. First operand 4735 states and 6623 transitions. Second operand 7 states. [2019-09-10 06:45:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:44,657 INFO L93 Difference]: Finished difference Result 15691 states and 22276 transitions. [2019-09-10 06:45:44,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:45:44,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:45:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:44,748 INFO L225 Difference]: With dead ends: 15691 [2019-09-10 06:45:44,748 INFO L226 Difference]: Without dead ends: 15691 [2019-09-10 06:45:44,749 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:45:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15691 states. [2019-09-10 06:45:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15691 to 4757. [2019-09-10 06:45:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4757 states. [2019-09-10 06:45:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6654 transitions. [2019-09-10 06:45:45,028 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6654 transitions. Word has length 58 [2019-09-10 06:45:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:45,030 INFO L475 AbstractCegarLoop]: Abstraction has 4757 states and 6654 transitions. [2019-09-10 06:45:45,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:45:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6654 transitions. [2019-09-10 06:45:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:45:45,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:45,033 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:45:45,033 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -879419620, now seen corresponding path program 1 times [2019-09-10 06:45:45,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:45,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:45,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:45,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:45,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:45,156 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:45:45,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:45,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:45:45,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:45,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:45:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:45:45,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:45:45,158 INFO L87 Difference]: Start difference. First operand 4757 states and 6654 transitions. Second operand 7 states. [2019-09-10 06:45:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:45,816 INFO L93 Difference]: Finished difference Result 13712 states and 19430 transitions. [2019-09-10 06:45:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:45:45,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:45:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:45,845 INFO L225 Difference]: With dead ends: 13712 [2019-09-10 06:45:45,845 INFO L226 Difference]: Without dead ends: 13712 [2019-09-10 06:45:45,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:45:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-09-10 06:45:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 4771. [2019-09-10 06:45:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-10 06:45:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6672 transitions. [2019-09-10 06:45:46,077 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6672 transitions. Word has length 58 [2019-09-10 06:45:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:46,078 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6672 transitions. [2019-09-10 06:45:46,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:45:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6672 transitions. [2019-09-10 06:45:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:45:46,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:46,081 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:45:46,081 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1079105450, now seen corresponding path program 1 times [2019-09-10 06:45:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:46,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:46,197 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:45:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:45:46,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:46,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:45:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:45:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:45:46,199 INFO L87 Difference]: Start difference. First operand 4771 states and 6672 transitions. Second operand 7 states. [2019-09-10 06:45:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:46,955 INFO L93 Difference]: Finished difference Result 20992 states and 29757 transitions. [2019-09-10 06:45:46,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:45:46,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:45:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:46,997 INFO L225 Difference]: With dead ends: 20992 [2019-09-10 06:45:46,997 INFO L226 Difference]: Without dead ends: 20992 [2019-09-10 06:45:46,998 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:45:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2019-09-10 06:45:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 4805. [2019-09-10 06:45:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4805 states. [2019-09-10 06:45:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6716 transitions. [2019-09-10 06:45:47,329 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6716 transitions. Word has length 58 [2019-09-10 06:45:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:47,329 INFO L475 AbstractCegarLoop]: Abstraction has 4805 states and 6716 transitions. [2019-09-10 06:45:47,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:45:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6716 transitions. [2019-09-10 06:45:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:45:47,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:47,335 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:45:47,336 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 184722790, now seen corresponding path program 1 times [2019-09-10 06:45:47,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:47,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:47,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:47,515 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:45:47,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:47,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:45:47,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:47,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:45:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:45:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:47,520 INFO L87 Difference]: Start difference. First operand 4805 states and 6716 transitions. Second operand 9 states. [2019-09-10 06:45:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:49,161 INFO L93 Difference]: Finished difference Result 17669 states and 25101 transitions. [2019-09-10 06:45:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:45:49,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:45:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:49,192 INFO L225 Difference]: With dead ends: 17669 [2019-09-10 06:45:49,193 INFO L226 Difference]: Without dead ends: 17669 [2019-09-10 06:45:49,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:45:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17669 states. [2019-09-10 06:45:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17669 to 4771. [2019-09-10 06:45:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-10 06:45:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6670 transitions. [2019-09-10 06:45:49,356 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6670 transitions. Word has length 59 [2019-09-10 06:45:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:49,356 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6670 transitions. [2019-09-10 06:45:49,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:45:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6670 transitions. [2019-09-10 06:45:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:45:49,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:49,366 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:45:49,367 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash -869337794, now seen corresponding path program 1 times [2019-09-10 06:45:49,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:49,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:49,596 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:45:49,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:49,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:45:49,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:49,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:45:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:45:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:49,598 INFO L87 Difference]: Start difference. First operand 4771 states and 6670 transitions. Second operand 9 states. [2019-09-10 06:45:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:51,027 INFO L93 Difference]: Finished difference Result 10673 states and 15203 transitions. [2019-09-10 06:45:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:45:51,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:45:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:51,049 INFO L225 Difference]: With dead ends: 10673 [2019-09-10 06:45:51,049 INFO L226 Difference]: Without dead ends: 10673 [2019-09-10 06:45:51,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:45:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-09-10 06:45:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 4771. [2019-09-10 06:45:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-10 06:45:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6668 transitions. [2019-09-10 06:45:51,258 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6668 transitions. Word has length 59 [2019-09-10 06:45:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:51,259 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6668 transitions. [2019-09-10 06:45:51,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:45:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6668 transitions. [2019-09-10 06:45:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:45:51,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:51,262 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:45:51,263 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2011941325, now seen corresponding path program 1 times [2019-09-10 06:45:51,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:51,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:51,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:51,442 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:45:51,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:51,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:45:51,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:51,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:45:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:45:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:45:51,444 INFO L87 Difference]: Start difference. First operand 4771 states and 6668 transitions. Second operand 8 states. [2019-09-10 06:45:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:52,480 INFO L93 Difference]: Finished difference Result 13608 states and 19485 transitions. [2019-09-10 06:45:52,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:45:52,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-10 06:45:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:52,502 INFO L225 Difference]: With dead ends: 13608 [2019-09-10 06:45:52,502 INFO L226 Difference]: Without dead ends: 13608 [2019-09-10 06:45:52,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:45:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13608 states. [2019-09-10 06:45:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13608 to 4614. [2019-09-10 06:45:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-10 06:45:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6462 transitions. [2019-09-10 06:45:52,644 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6462 transitions. Word has length 59 [2019-09-10 06:45:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:52,644 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6462 transitions. [2019-09-10 06:45:52,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:45:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6462 transitions. [2019-09-10 06:45:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:45:52,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:52,649 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:45:52,650 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2023106222, now seen corresponding path program 1 times [2019-09-10 06:45:52,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:52,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:52,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:52,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:45:52,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:52,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:52,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:52,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:52,829 INFO L87 Difference]: Start difference. First operand 4614 states and 6462 transitions. Second operand 3 states. [2019-09-10 06:45:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:52,880 INFO L93 Difference]: Finished difference Result 4620 states and 6396 transitions. [2019-09-10 06:45:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:52,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:45:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:52,890 INFO L225 Difference]: With dead ends: 4620 [2019-09-10 06:45:52,890 INFO L226 Difference]: Without dead ends: 4620 [2019-09-10 06:45:52,891 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:45:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2019-09-10 06:45:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4614. [2019-09-10 06:45:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-10 06:45:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6392 transitions. [2019-09-10 06:45:52,949 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6392 transitions. Word has length 60 [2019-09-10 06:45:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:52,949 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6392 transitions. [2019-09-10 06:45:52,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6392 transitions. [2019-09-10 06:45:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:45:52,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:52,954 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:45:52,956 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2132862918, now seen corresponding path program 1 times [2019-09-10 06:45:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:52,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:53,056 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:45:53,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:53,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:53,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:53,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:53,059 INFO L87 Difference]: Start difference. First operand 4614 states and 6392 transitions. Second operand 3 states. [2019-09-10 06:45:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,126 INFO L93 Difference]: Finished difference Result 4621 states and 6322 transitions. [2019-09-10 06:45:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:53,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:45:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,135 INFO L225 Difference]: With dead ends: 4621 [2019-09-10 06:45:53,136 INFO L226 Difference]: Without dead ends: 4621 [2019-09-10 06:45:53,137 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:45:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2019-09-10 06:45:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4614. [2019-09-10 06:45:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-10 06:45:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6317 transitions. [2019-09-10 06:45:53,216 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6317 transitions. Word has length 60 [2019-09-10 06:45:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:53,217 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6317 transitions. [2019-09-10 06:45:53,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6317 transitions. [2019-09-10 06:45:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:45:53,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:53,220 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:45:53,220 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1598100968, now seen corresponding path program 1 times [2019-09-10 06:45:53,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:53,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:53,328 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:45:53,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:53,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:53,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:53,329 INFO L87 Difference]: Start difference. First operand 4614 states and 6317 transitions. Second operand 3 states. [2019-09-10 06:45:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,366 INFO L93 Difference]: Finished difference Result 4580 states and 6176 transitions. [2019-09-10 06:45:53,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:53,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:45:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,375 INFO L225 Difference]: With dead ends: 4580 [2019-09-10 06:45:53,375 INFO L226 Difference]: Without dead ends: 4580 [2019-09-10 06:45:53,378 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:45:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2019-09-10 06:45:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4574. [2019-09-10 06:45:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2019-09-10 06:45:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6172 transitions. [2019-09-10 06:45:53,446 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6172 transitions. Word has length 60 [2019-09-10 06:45:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:53,446 INFO L475 AbstractCegarLoop]: Abstraction has 4574 states and 6172 transitions. [2019-09-10 06:45:53,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6172 transitions. [2019-09-10 06:45:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:45:53,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:53,450 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:45:53,450 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1654307287, now seen corresponding path program 1 times [2019-09-10 06:45:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:53,514 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:45:53,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:53,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:53,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:53,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:53,516 INFO L87 Difference]: Start difference. First operand 4574 states and 6172 transitions. Second operand 3 states. [2019-09-10 06:45:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,590 INFO L93 Difference]: Finished difference Result 5711 states and 7731 transitions. [2019-09-10 06:45:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:53,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:45:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,601 INFO L225 Difference]: With dead ends: 5711 [2019-09-10 06:45:53,601 INFO L226 Difference]: Without dead ends: 5711 [2019-09-10 06:45:53,601 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:45:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-09-10 06:45:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4191. [2019-09-10 06:45:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-09-10 06:45:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5670 transitions. [2019-09-10 06:45:53,661 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5670 transitions. Word has length 61 [2019-09-10 06:45:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:53,662 INFO L475 AbstractCegarLoop]: Abstraction has 4191 states and 5670 transitions. [2019-09-10 06:45:53,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5670 transitions. [2019-09-10 06:45:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:45:53,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:53,665 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] [2019-09-10 06:45:53,665 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1763616113, now seen corresponding path program 1 times [2019-09-10 06:45:53,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:53,721 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:45:53,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:53,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:53,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:53,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:53,723 INFO L87 Difference]: Start difference. First operand 4191 states and 5670 transitions. Second operand 3 states. [2019-09-10 06:45:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,789 INFO L93 Difference]: Finished difference Result 5867 states and 8017 transitions. [2019-09-10 06:45:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:53,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:45:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,799 INFO L225 Difference]: With dead ends: 5867 [2019-09-10 06:45:53,799 INFO L226 Difference]: Without dead ends: 5867 [2019-09-10 06:45:53,800 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:45:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2019-09-10 06:45:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 4130. [2019-09-10 06:45:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2019-09-10 06:45:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 5583 transitions. [2019-09-10 06:45:53,864 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 5583 transitions. Word has length 62 [2019-09-10 06:45:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:53,864 INFO L475 AbstractCegarLoop]: Abstraction has 4130 states and 5583 transitions. [2019-09-10 06:45:53,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 5583 transitions. [2019-09-10 06:45:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:45:53,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:53,873 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] [2019-09-10 06:45:53,873 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:53,873 INFO L82 PathProgramCache]: Analyzing trace with hash -131917929, now seen corresponding path program 1 times [2019-09-10 06:45:53,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:53,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:53,928 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:45:53,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:53,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:53,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:53,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:53,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:53,930 INFO L87 Difference]: Start difference. First operand 4130 states and 5583 transitions. Second operand 3 states. [2019-09-10 06:45:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:54,017 INFO L93 Difference]: Finished difference Result 5782 states and 7893 transitions. [2019-09-10 06:45:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:45:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:54,030 INFO L225 Difference]: With dead ends: 5782 [2019-09-10 06:45:54,030 INFO L226 Difference]: Without dead ends: 5782 [2019-09-10 06:45:54,031 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:45:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2019-09-10 06:45:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 4043. [2019-09-10 06:45:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4043 states. [2019-09-10 06:45:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 5466 transitions. [2019-09-10 06:45:54,111 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 5466 transitions. Word has length 62 [2019-09-10 06:45:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:54,112 INFO L475 AbstractCegarLoop]: Abstraction has 4043 states and 5466 transitions. [2019-09-10 06:45:54,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 5466 transitions. [2019-09-10 06:45:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:45:54,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:54,116 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] [2019-09-10 06:45:54,116 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1773291386, now seen corresponding path program 1 times [2019-09-10 06:45:54,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:54,563 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-10 06:45:54,834 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:45:54,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:54,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:45:54,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:54,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:45:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:45:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:45:54,836 INFO L87 Difference]: Start difference. First operand 4043 states and 5466 transitions. Second operand 13 states. [2019-09-10 06:45:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:57,006 INFO L93 Difference]: Finished difference Result 6152 states and 8386 transitions. [2019-09-10 06:45:57,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:45:57,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-10 06:45:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:57,013 INFO L225 Difference]: With dead ends: 6152 [2019-09-10 06:45:57,013 INFO L226 Difference]: Without dead ends: 6152 [2019-09-10 06:45:57,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:45:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2019-09-10 06:45:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 4039. [2019-09-10 06:45:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2019-09-10 06:45:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 5462 transitions. [2019-09-10 06:45:57,072 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 5462 transitions. Word has length 62 [2019-09-10 06:45:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:57,072 INFO L475 AbstractCegarLoop]: Abstraction has 4039 states and 5462 transitions. [2019-09-10 06:45:57,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:45:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 5462 transitions. [2019-09-10 06:45:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:45:57,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:57,075 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] [2019-09-10 06:45:57,075 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -625592832, now seen corresponding path program 1 times [2019-09-10 06:45:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:57,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:57,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:57,459 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:45:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:45:57,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:57,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:45:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:45:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:45:57,461 INFO L87 Difference]: Start difference. First operand 4039 states and 5462 transitions. Second operand 10 states. [2019-09-10 06:45:57,841 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 06:45:57,990 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 06:45:58,147 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:45:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:58,967 INFO L93 Difference]: Finished difference Result 8297 states and 11363 transitions. [2019-09-10 06:45:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:45:58,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-09-10 06:45:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:58,977 INFO L225 Difference]: With dead ends: 8297 [2019-09-10 06:45:58,977 INFO L226 Difference]: Without dead ends: 8297 [2019-09-10 06:45:58,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:45:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8297 states. [2019-09-10 06:45:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8297 to 3970. [2019-09-10 06:45:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2019-09-10 06:45:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 5382 transitions. [2019-09-10 06:45:59,046 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 5382 transitions. Word has length 62 [2019-09-10 06:45:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:59,047 INFO L475 AbstractCegarLoop]: Abstraction has 3970 states and 5382 transitions. [2019-09-10 06:45:59,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:45:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 5382 transitions. [2019-09-10 06:45:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:45:59,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:59,052 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] [2019-09-10 06:45:59,053 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2083745963, now seen corresponding path program 1 times [2019-09-10 06:45:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:59,145 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:45:59,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:45:59,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:59,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:45:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:45:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:45:59,146 INFO L87 Difference]: Start difference. First operand 3970 states and 5382 transitions. Second operand 6 states. [2019-09-10 06:45:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:59,310 INFO L93 Difference]: Finished difference Result 12305 states and 16625 transitions. [2019-09-10 06:45:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:45:59,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:45:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:59,325 INFO L225 Difference]: With dead ends: 12305 [2019-09-10 06:45:59,325 INFO L226 Difference]: Without dead ends: 12305 [2019-09-10 06:45:59,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:45:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12305 states. [2019-09-10 06:45:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12305 to 9884. [2019-09-10 06:45:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9884 states. [2019-09-10 06:45:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9884 states to 9884 states and 13340 transitions. [2019-09-10 06:45:59,442 INFO L78 Accepts]: Start accepts. Automaton has 9884 states and 13340 transitions. Word has length 72 [2019-09-10 06:45:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:59,443 INFO L475 AbstractCegarLoop]: Abstraction has 9884 states and 13340 transitions. [2019-09-10 06:45:59,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:45:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 9884 states and 13340 transitions. [2019-09-10 06:45:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:45:59,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:59,453 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:45:59,453 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1744904066, now seen corresponding path program 1 times [2019-09-10 06:45:59,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:59,567 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:45:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:59,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:59,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:59,569 INFO L87 Difference]: Start difference. First operand 9884 states and 13340 transitions. Second operand 5 states. [2019-09-10 06:45:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:59,682 INFO L93 Difference]: Finished difference Result 9068 states and 12267 transitions. [2019-09-10 06:45:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:59,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-10 06:45:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:59,692 INFO L225 Difference]: With dead ends: 9068 [2019-09-10 06:45:59,692 INFO L226 Difference]: Without dead ends: 9068 [2019-09-10 06:45:59,692 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:45:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states. [2019-09-10 06:45:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 9064. [2019-09-10 06:45:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9064 states. [2019-09-10 06:45:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9064 states to 9064 states and 12265 transitions. [2019-09-10 06:45:59,777 INFO L78 Accepts]: Start accepts. Automaton has 9064 states and 12265 transitions. Word has length 73 [2019-09-10 06:45:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:59,778 INFO L475 AbstractCegarLoop]: Abstraction has 9064 states and 12265 transitions. [2019-09-10 06:45:59,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9064 states and 12265 transitions. [2019-09-10 06:45:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:45:59,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:59,787 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] [2019-09-10 06:45:59,787 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1665118235, now seen corresponding path program 1 times [2019-09-10 06:45:59,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:59,884 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:45:59,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:59,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:45:59,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:59,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:45:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:45:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:45:59,887 INFO L87 Difference]: Start difference. First operand 9064 states and 12265 transitions. Second operand 6 states. [2019-09-10 06:46:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:00,025 INFO L93 Difference]: Finished difference Result 16601 states and 22170 transitions. [2019-09-10 06:46:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:00,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-10 06:46:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:00,040 INFO L225 Difference]: With dead ends: 16601 [2019-09-10 06:46:00,040 INFO L226 Difference]: Without dead ends: 16601 [2019-09-10 06:46:00,042 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:46:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16601 states. [2019-09-10 06:46:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16601 to 9289. [2019-09-10 06:46:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9289 states. [2019-09-10 06:46:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9289 states to 9289 states and 12415 transitions. [2019-09-10 06:46:00,220 INFO L78 Accepts]: Start accepts. Automaton has 9289 states and 12415 transitions. Word has length 74 [2019-09-10 06:46:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:00,220 INFO L475 AbstractCegarLoop]: Abstraction has 9289 states and 12415 transitions. [2019-09-10 06:46:00,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9289 states and 12415 transitions. [2019-09-10 06:46:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:46:00,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:00,227 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] [2019-09-10 06:46:00,227 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1859339602, now seen corresponding path program 1 times [2019-09-10 06:46:00,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:00,287 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:46:00,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:00,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:00,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:00,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:00,289 INFO L87 Difference]: Start difference. First operand 9289 states and 12415 transitions. Second operand 3 states. [2019-09-10 06:46:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:00,353 INFO L93 Difference]: Finished difference Result 16828 states and 22230 transitions. [2019-09-10 06:46:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:00,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:46:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:00,371 INFO L225 Difference]: With dead ends: 16828 [2019-09-10 06:46:00,371 INFO L226 Difference]: Without dead ends: 16828 [2019-09-10 06:46:00,371 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:46:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16828 states. [2019-09-10 06:46:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16828 to 15767. [2019-09-10 06:46:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2019-09-10 06:46:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 20948 transitions. [2019-09-10 06:46:00,542 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 20948 transitions. Word has length 75 [2019-09-10 06:46:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:00,543 INFO L475 AbstractCegarLoop]: Abstraction has 15767 states and 20948 transitions. [2019-09-10 06:46:00,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 20948 transitions. [2019-09-10 06:46:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:46:00,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:00,548 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1309001061, now seen corresponding path program 1 times [2019-09-10 06:46:00,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:00,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:00,611 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:46:00,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:00,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:00,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:00,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:00,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:00,613 INFO L87 Difference]: Start difference. First operand 15767 states and 20948 transitions. Second operand 3 states. [2019-09-10 06:46:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:00,700 INFO L93 Difference]: Finished difference Result 28904 states and 37752 transitions. [2019-09-10 06:46:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:00,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:46:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:00,725 INFO L225 Difference]: With dead ends: 28904 [2019-09-10 06:46:00,725 INFO L226 Difference]: Without dead ends: 28904 [2019-09-10 06:46:00,725 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:46:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28904 states. [2019-09-10 06:46:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28904 to 26762. [2019-09-10 06:46:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26762 states. [2019-09-10 06:46:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26762 states to 26762 states and 35121 transitions. [2019-09-10 06:46:00,946 INFO L78 Accepts]: Start accepts. Automaton has 26762 states and 35121 transitions. Word has length 76 [2019-09-10 06:46:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:00,947 INFO L475 AbstractCegarLoop]: Abstraction has 26762 states and 35121 transitions. [2019-09-10 06:46:00,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26762 states and 35121 transitions. [2019-09-10 06:46:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:46:00,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:00,951 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:46:00,952 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 449656965, now seen corresponding path program 1 times [2019-09-10 06:46:00,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:00,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:01,649 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:46:01,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:01,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:01,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:01,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:01,651 INFO L87 Difference]: Start difference. First operand 26762 states and 35121 transitions. Second operand 3 states. [2019-09-10 06:46:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:01,783 INFO L93 Difference]: Finished difference Result 39407 states and 51183 transitions. [2019-09-10 06:46:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:01,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:46:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:01,831 INFO L225 Difference]: With dead ends: 39407 [2019-09-10 06:46:01,832 INFO L226 Difference]: Without dead ends: 39407 [2019-09-10 06:46:01,832 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:46:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39407 states. [2019-09-10 06:46:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39407 to 39405. [2019-09-10 06:46:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39405 states. [2019-09-10 06:46:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39405 states to 39405 states and 51182 transitions. [2019-09-10 06:46:02,174 INFO L78 Accepts]: Start accepts. Automaton has 39405 states and 51182 transitions. Word has length 78 [2019-09-10 06:46:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:02,175 INFO L475 AbstractCegarLoop]: Abstraction has 39405 states and 51182 transitions. [2019-09-10 06:46:02,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 39405 states and 51182 transitions. [2019-09-10 06:46:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:46:02,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:02,182 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] [2019-09-10 06:46:02,182 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1613619318, now seen corresponding path program 1 times [2019-09-10 06:46:02,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:02,249 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:46:02,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:02,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:02,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:02,251 INFO L87 Difference]: Start difference. First operand 39405 states and 51182 transitions. Second operand 5 states. [2019-09-10 06:46:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:02,843 INFO L93 Difference]: Finished difference Result 70084 states and 87948 transitions. [2019-09-10 06:46:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:02,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 06:46:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:02,955 INFO L225 Difference]: With dead ends: 70084 [2019-09-10 06:46:02,956 INFO L226 Difference]: Without dead ends: 70084 [2019-09-10 06:46:02,956 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:46:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70084 states. [2019-09-10 06:46:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70084 to 43828. [2019-09-10 06:46:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43828 states. [2019-09-10 06:46:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43828 states to 43828 states and 56229 transitions. [2019-09-10 06:46:03,759 INFO L78 Accepts]: Start accepts. Automaton has 43828 states and 56229 transitions. Word has length 89 [2019-09-10 06:46:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:03,760 INFO L475 AbstractCegarLoop]: Abstraction has 43828 states and 56229 transitions. [2019-09-10 06:46:03,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 43828 states and 56229 transitions. [2019-09-10 06:46:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:46:03,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:03,769 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] [2019-09-10 06:46:03,769 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:03,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1950557848, now seen corresponding path program 1 times [2019-09-10 06:46:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:03,841 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:46:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:03,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:03,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:03,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:03,842 INFO L87 Difference]: Start difference. First operand 43828 states and 56229 transitions. Second operand 3 states. [2019-09-10 06:46:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:04,102 INFO L93 Difference]: Finished difference Result 81858 states and 102410 transitions. [2019-09-10 06:46:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:04,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:46:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:04,216 INFO L225 Difference]: With dead ends: 81858 [2019-09-10 06:46:04,216 INFO L226 Difference]: Without dead ends: 81858 [2019-09-10 06:46:04,217 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:46:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81858 states. [2019-09-10 06:46:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81858 to 71410. [2019-09-10 06:46:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71410 states. [2019-09-10 06:46:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71410 states to 71410 states and 90250 transitions. [2019-09-10 06:46:06,010 INFO L78 Accepts]: Start accepts. Automaton has 71410 states and 90250 transitions. Word has length 97 [2019-09-10 06:46:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:06,011 INFO L475 AbstractCegarLoop]: Abstraction has 71410 states and 90250 transitions. [2019-09-10 06:46:06,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 71410 states and 90250 transitions. [2019-09-10 06:46:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:46:06,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:06,020 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] [2019-09-10 06:46:06,020 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1162840062, now seen corresponding path program 1 times [2019-09-10 06:46:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:06,163 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:46:06,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:06,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:06,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:46:06,168 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], [76], [110], [113], [116], [129], [132], [145], [148], [161], [164], [167], [171], [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], [509], [570], [700], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:46:06,228 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:06,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:06,475 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:07,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:07,070 INFO L272 AbstractInterpreter]: Visited 93 different actions 361 times. Merged at 31 different actions 234 times. Widened at 11 different actions 32 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 27 fixpoints after 8 different actions. Largest state had 234 variables. [2019-09-10 06:46:07,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:07,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:07,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:07,077 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:46:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:07,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:46:07,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:07,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:07,636 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:46:07,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:07,936 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:46:07,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 06:46:07,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:07,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:46:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:46:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:46:07,943 INFO L87 Difference]: Start difference. First operand 71410 states and 90250 transitions. Second operand 13 states. [2019-09-10 06:46:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:11,768 INFO L93 Difference]: Finished difference Result 256887 states and 323905 transitions. [2019-09-10 06:46:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:46:11,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-10 06:46:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:12,517 INFO L225 Difference]: With dead ends: 256887 [2019-09-10 06:46:12,518 INFO L226 Difference]: Without dead ends: 256887 [2019-09-10 06:46:12,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=537, Invalid=1625, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:46:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256887 states. [2019-09-10 06:46:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256887 to 106700. [2019-09-10 06:46:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106700 states. [2019-09-10 06:46:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106700 states to 106700 states and 134726 transitions. [2019-09-10 06:46:17,600 INFO L78 Accepts]: Start accepts. Automaton has 106700 states and 134726 transitions. Word has length 99 [2019-09-10 06:46:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:17,601 INFO L475 AbstractCegarLoop]: Abstraction has 106700 states and 134726 transitions. [2019-09-10 06:46:17,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:46:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 106700 states and 134726 transitions. [2019-09-10 06:46:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:46:17,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:17,612 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] [2019-09-10 06:46:17,613 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 719809032, now seen corresponding path program 1 times [2019-09-10 06:46:17,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:17,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:17,700 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:46:17,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:17,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:17,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:46:17,701 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [129], [132], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [350], [358], [377], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [509], [570], [700], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:46:17,705 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:17,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:17,751 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:17,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:46:17,942 INFO L272 AbstractInterpreter]: Visited 90 different actions 275 times. Merged at 27 different actions 160 times. Widened at 10 different actions 19 times. Performed 1276 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 5 different actions. Largest state had 234 variables. [2019-09-10 06:46:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:17,942 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:46:18,441 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 92.34% of their original sizes. [2019-09-10 06:46:18,441 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:46:24,142 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 06:46:24,142 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:46:24,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:46:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 06:46:24,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:24,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 06:46:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 06:46:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3389, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:46:24,145 INFO L87 Difference]: Start difference. First operand 106700 states and 134726 transitions. Second operand 62 states. [2019-09-10 06:47:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:10,085 INFO L93 Difference]: Finished difference Result 156539 states and 196343 transitions. [2019-09-10 06:47:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-10 06:47:10,085 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-09-10 06:47:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:10,301 INFO L225 Difference]: With dead ends: 156539 [2019-09-10 06:47:10,301 INFO L226 Difference]: Without dead ends: 156539 [2019-09-10 06:47:10,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2465, Invalid=20185, Unknown=0, NotChecked=0, Total=22650 [2019-09-10 06:47:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156539 states. [2019-09-10 06:47:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156539 to 107236. [2019-09-10 06:47:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107236 states. [2019-09-10 06:47:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107236 states to 107236 states and 135072 transitions. [2019-09-10 06:47:11,433 INFO L78 Accepts]: Start accepts. Automaton has 107236 states and 135072 transitions. Word has length 100 [2019-09-10 06:47:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:11,436 INFO L475 AbstractCegarLoop]: Abstraction has 107236 states and 135072 transitions. [2019-09-10 06:47:11,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 06:47:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 107236 states and 135072 transitions. [2019-09-10 06:47:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:47:11,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:11,451 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] [2019-09-10 06:47:11,452 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash -15585594, now seen corresponding path program 1 times [2019-09-10 06:47:11,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:11,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:11,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:11,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:11,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:11,530 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:47:11,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:11,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:11,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:11,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:11,532 INFO L87 Difference]: Start difference. First operand 107236 states and 135072 transitions. Second operand 5 states. [2019-09-10 06:47:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:12,653 INFO L93 Difference]: Finished difference Result 126923 states and 156779 transitions. [2019-09-10 06:47:12,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:12,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:47:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:12,764 INFO L225 Difference]: With dead ends: 126923 [2019-09-10 06:47:12,764 INFO L226 Difference]: Without dead ends: 126923 [2019-09-10 06:47:12,764 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:47:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126923 states. [2019-09-10 06:47:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126923 to 101588. [2019-09-10 06:47:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101588 states. [2019-09-10 06:47:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101588 states to 101588 states and 126443 transitions. [2019-09-10 06:47:13,693 INFO L78 Accepts]: Start accepts. Automaton has 101588 states and 126443 transitions. Word has length 101 [2019-09-10 06:47:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:13,694 INFO L475 AbstractCegarLoop]: Abstraction has 101588 states and 126443 transitions. [2019-09-10 06:47:13,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 101588 states and 126443 transitions. [2019-09-10 06:47:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:47:13,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:13,702 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] [2019-09-10 06:47:13,703 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1914724117, now seen corresponding path program 1 times [2019-09-10 06:47:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:13,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:13,769 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:47:13,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:13,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:13,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:47:13,770 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [129], [132], [145], [148], [151], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [350], [358], [377], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [507], [570], [700], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:47:13,774 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:13,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:13,811 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:13,946 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:47:13,947 INFO L272 AbstractInterpreter]: Visited 91 different actions 275 times. Merged at 27 different actions 159 times. Widened at 9 different actions 14 times. Performed 1273 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 4 different actions. Largest state had 234 variables. [2019-09-10 06:47:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:13,947 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:47:14,244 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 92.41% of their original sizes. [2019-09-10 06:47:14,245 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:47:22,024 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 06:47:22,024 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:47:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:47:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 06:47:22,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:22,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 06:47:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 06:47:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3540, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 06:47:22,027 INFO L87 Difference]: Start difference. First operand 101588 states and 126443 transitions. Second operand 63 states. [2019-09-10 06:47:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:58,743 INFO L93 Difference]: Finished difference Result 150164 states and 185835 transitions. [2019-09-10 06:47:58,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 06:47:58,743 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 101 [2019-09-10 06:47:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:58,887 INFO L225 Difference]: With dead ends: 150164 [2019-09-10 06:47:58,888 INFO L226 Difference]: Without dead ends: 150164 [2019-09-10 06:47:58,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4763 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1879, Invalid=15413, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 06:47:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150164 states. [2019-09-10 06:47:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150164 to 101621. [2019-09-10 06:47:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101621 states. [2019-09-10 06:48:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101621 states to 101621 states and 126478 transitions. [2019-09-10 06:48:00,000 INFO L78 Accepts]: Start accepts. Automaton has 101621 states and 126478 transitions. Word has length 101 [2019-09-10 06:48:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:00,000 INFO L475 AbstractCegarLoop]: Abstraction has 101621 states and 126478 transitions. [2019-09-10 06:48:00,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 06:48:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 101621 states and 126478 transitions. [2019-09-10 06:48:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:00,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:00,010 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] [2019-09-10 06:48:00,010 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1855442686, now seen corresponding path program 1 times [2019-09-10 06:48:00,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:00,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:00,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:00,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:48:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:00,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:00,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:00,119 INFO L87 Difference]: Start difference. First operand 101621 states and 126478 transitions. Second operand 5 states. [2019-09-10 06:48:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:00,446 INFO L93 Difference]: Finished difference Result 139847 states and 173614 transitions. [2019-09-10 06:48:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:00,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:48:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:00,578 INFO L225 Difference]: With dead ends: 139847 [2019-09-10 06:48:00,578 INFO L226 Difference]: Without dead ends: 139847 [2019-09-10 06:48:00,579 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:48:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139847 states. [2019-09-10 06:48:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139847 to 116009. [2019-09-10 06:48:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116009 states. [2019-09-10 06:48:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116009 states to 116009 states and 144156 transitions. [2019-09-10 06:48:02,133 INFO L78 Accepts]: Start accepts. Automaton has 116009 states and 144156 transitions. Word has length 103 [2019-09-10 06:48:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:02,134 INFO L475 AbstractCegarLoop]: Abstraction has 116009 states and 144156 transitions. [2019-09-10 06:48:02,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 116009 states and 144156 transitions. [2019-09-10 06:48:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:48:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:02,144 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] [2019-09-10 06:48:02,144 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1041085272, now seen corresponding path program 1 times [2019-09-10 06:48:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:02,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:02,236 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:48:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:02,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:48:02,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:02,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:48:02,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:48:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:48:02,238 INFO L87 Difference]: Start difference. First operand 116009 states and 144156 transitions. Second operand 4 states. [2019-09-10 06:48:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:03,287 INFO L93 Difference]: Finished difference Result 252566 states and 313298 transitions. [2019-09-10 06:48:03,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:03,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 06:48:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:03,568 INFO L225 Difference]: With dead ends: 252566 [2019-09-10 06:48:03,568 INFO L226 Difference]: Without dead ends: 252566 [2019-09-10 06:48:03,568 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:48:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252566 states. [2019-09-10 06:48:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252566 to 115459. [2019-09-10 06:48:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115459 states. [2019-09-10 06:48:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115459 states to 115459 states and 143509 transitions. [2019-09-10 06:48:05,755 INFO L78 Accepts]: Start accepts. Automaton has 115459 states and 143509 transitions. Word has length 105 [2019-09-10 06:48:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:05,755 INFO L475 AbstractCegarLoop]: Abstraction has 115459 states and 143509 transitions. [2019-09-10 06:48:05,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:48:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 115459 states and 143509 transitions. [2019-09-10 06:48:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:48:05,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:05,764 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] [2019-09-10 06:48:05,765 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash 680245603, now seen corresponding path program 1 times [2019-09-10 06:48:05,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:05,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:05,869 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:48:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:05,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:05,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:05,871 INFO L87 Difference]: Start difference. First operand 115459 states and 143509 transitions. Second operand 5 states. [2019-09-10 06:48:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:06,621 INFO L93 Difference]: Finished difference Result 211058 states and 259714 transitions. [2019-09-10 06:48:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:06,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 06:48:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:06,844 INFO L225 Difference]: With dead ends: 211058 [2019-09-10 06:48:06,845 INFO L226 Difference]: Without dead ends: 211058 [2019-09-10 06:48:06,845 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:48:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211058 states. [2019-09-10 06:48:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211058 to 115076. [2019-09-10 06:48:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-09-10 06:48:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 143044 transitions. [2019-09-10 06:48:09,001 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 143044 transitions. Word has length 105 [2019-09-10 06:48:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:09,001 INFO L475 AbstractCegarLoop]: Abstraction has 115076 states and 143044 transitions. [2019-09-10 06:48:09,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 143044 transitions. [2019-09-10 06:48:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:48:09,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:09,009 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] [2019-09-10 06:48:09,010 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1800782462, now seen corresponding path program 1 times [2019-09-10 06:48:09,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:09,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:09,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:09,096 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:48:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:09,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:09,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:09,098 INFO L87 Difference]: Start difference. First operand 115076 states and 143044 transitions. Second operand 5 states. [2019-09-10 06:48:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:09,515 INFO L93 Difference]: Finished difference Result 147357 states and 182895 transitions. [2019-09-10 06:48:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:09,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 06:48:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:09,664 INFO L225 Difference]: With dead ends: 147357 [2019-09-10 06:48:09,665 INFO L226 Difference]: Without dead ends: 147357 [2019-09-10 06:48:09,665 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:48:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147357 states. [2019-09-10 06:48:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147357 to 129477. [2019-09-10 06:48:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129477 states. [2019-09-10 06:48:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129477 states to 129477 states and 160683 transitions. [2019-09-10 06:48:10,778 INFO L78 Accepts]: Start accepts. Automaton has 129477 states and 160683 transitions. Word has length 106 [2019-09-10 06:48:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:10,778 INFO L475 AbstractCegarLoop]: Abstraction has 129477 states and 160683 transitions. [2019-09-10 06:48:10,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 129477 states and 160683 transitions. [2019-09-10 06:48:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:48:10,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:10,784 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] [2019-09-10 06:48:10,785 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1134697774, now seen corresponding path program 1 times [2019-09-10 06:48:10,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:10,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:10,848 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:48:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:10,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:10,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:48:10,850 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:48:10,854 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:10,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:10,897 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:11,100 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:48:11,100 INFO L272 AbstractInterpreter]: Visited 96 different actions 276 times. Merged at 29 different actions 157 times. Widened at 11 different actions 15 times. Performed 1271 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1271 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 237 variables. [2019-09-10 06:48:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:11,101 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:48:11,421 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 92.72% of their original sizes. [2019-09-10 06:48:11,421 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:48:17,958 INFO L420 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2019-09-10 06:48:17,959 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:48:17,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:48:17,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2019-09-10 06:48:17,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:17,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 06:48:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 06:48:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3856, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:48:17,961 INFO L87 Difference]: Start difference. First operand 129477 states and 160683 transitions. Second operand 65 states. [2019-09-10 06:48:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:59,849 INFO L93 Difference]: Finished difference Result 164301 states and 203169 transitions. [2019-09-10 06:48:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 06:48:59,849 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 106 [2019-09-10 06:48:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:00,009 INFO L225 Difference]: With dead ends: 164301 [2019-09-10 06:49:00,009 INFO L226 Difference]: Without dead ends: 164301 [2019-09-10 06:49:00,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3278 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1008, Invalid=12332, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 06:49:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164301 states. [2019-09-10 06:49:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164301 to 137237. [2019-09-10 06:49:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137237 states. [2019-09-10 06:49:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137237 states to 137237 states and 170242 transitions. [2019-09-10 06:49:02,115 INFO L78 Accepts]: Start accepts. Automaton has 137237 states and 170242 transitions. Word has length 106 [2019-09-10 06:49:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:02,115 INFO L475 AbstractCegarLoop]: Abstraction has 137237 states and 170242 transitions. [2019-09-10 06:49:02,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 06:49:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 137237 states and 170242 transitions. [2019-09-10 06:49:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:49:02,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:02,122 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] [2019-09-10 06:49:02,123 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1990651521, now seen corresponding path program 1 times [2019-09-10 06:49:02,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:02,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:02,194 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:49:02,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:02,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:02,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 06:49:02,195 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [509], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:49:02,198 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:02,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:02,226 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:02,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:49:02,371 INFO L272 AbstractInterpreter]: Visited 97 different actions 313 times. Merged at 32 different actions 190 times. Widened at 10 different actions 13 times. Performed 1429 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1429 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 5 different actions. Largest state had 236 variables. [2019-09-10 06:49:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:02,372 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:49:02,594 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 92.33% of their original sizes. [2019-09-10 06:49:02,595 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:49:08,746 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 06:49:08,746 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:49:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:08,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 06:49:08,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:08,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 06:49:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 06:49:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4288, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 06:49:08,749 INFO L87 Difference]: Start difference. First operand 137237 states and 170242 transitions. Second operand 68 states. [2019-09-10 06:50:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:02,488 INFO L93 Difference]: Finished difference Result 138124 states and 171182 transitions. [2019-09-10 06:50:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 06:50:02,488 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 107 [2019-09-10 06:50:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:02,632 INFO L225 Difference]: With dead ends: 138124 [2019-09-10 06:50:02,632 INFO L226 Difference]: Without dead ends: 138124 [2019-09-10 06:50:02,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=929, Invalid=12643, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 06:50:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138124 states. [2019-09-10 06:50:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138124 to 137414. [2019-09-10 06:50:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137414 states. [2019-09-10 06:50:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137414 states to 137414 states and 170440 transitions. [2019-09-10 06:50:03,708 INFO L78 Accepts]: Start accepts. Automaton has 137414 states and 170440 transitions. Word has length 107 [2019-09-10 06:50:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:03,708 INFO L475 AbstractCegarLoop]: Abstraction has 137414 states and 170440 transitions. [2019-09-10 06:50:03,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 06:50:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 137414 states and 170440 transitions. [2019-09-10 06:50:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:50:03,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:03,715 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] [2019-09-10 06:50:03,715 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 543051623, now seen corresponding path program 1 times [2019-09-10 06:50:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:03,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:03,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:03,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:03,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:03,781 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:50:03,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:03,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:50:03,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:03,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:50:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:50:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:50:03,783 INFO L87 Difference]: Start difference. First operand 137414 states and 170440 transitions. Second operand 4 states. [2019-09-10 06:50:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:04,500 INFO L93 Difference]: Finished difference Result 240456 states and 295900 transitions. [2019-09-10 06:50:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:04,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 06:50:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:05,454 INFO L225 Difference]: With dead ends: 240456 [2019-09-10 06:50:05,455 INFO L226 Difference]: Without dead ends: 240456 [2019-09-10 06:50:05,455 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:50:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240456 states. [2019-09-10 06:50:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240456 to 162171. [2019-09-10 06:50:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162171 states. [2019-09-10 06:50:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162171 states to 162171 states and 200922 transitions. [2019-09-10 06:50:06,923 INFO L78 Accepts]: Start accepts. Automaton has 162171 states and 200922 transitions. Word has length 109 [2019-09-10 06:50:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:06,924 INFO L475 AbstractCegarLoop]: Abstraction has 162171 states and 200922 transitions. [2019-09-10 06:50:06,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:50:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 162171 states and 200922 transitions. [2019-09-10 06:50:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:50:06,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:06,934 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] [2019-09-10 06:50:06,934 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1152296734, now seen corresponding path program 1 times [2019-09-10 06:50:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:06,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:06,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:06,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:06,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:07,876 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:50:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:50:07,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:07,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:50:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:50:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:50:07,877 INFO L87 Difference]: Start difference. First operand 162171 states and 200922 transitions. Second operand 10 states. [2019-09-10 06:50:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:10,492 INFO L93 Difference]: Finished difference Result 425342 states and 521353 transitions. [2019-09-10 06:50:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:50:10,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2019-09-10 06:50:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:10,964 INFO L225 Difference]: With dead ends: 425342 [2019-09-10 06:50:10,965 INFO L226 Difference]: Without dead ends: 425342 [2019-09-10 06:50:10,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:50:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425342 states. [2019-09-10 06:50:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425342 to 214707. [2019-09-10 06:50:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214707 states. [2019-09-10 06:50:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214707 states to 214707 states and 265339 transitions. [2019-09-10 06:50:15,527 INFO L78 Accepts]: Start accepts. Automaton has 214707 states and 265339 transitions. Word has length 109 [2019-09-10 06:50:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:15,527 INFO L475 AbstractCegarLoop]: Abstraction has 214707 states and 265339 transitions. [2019-09-10 06:50:15,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:50:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 214707 states and 265339 transitions. [2019-09-10 06:50:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:50:15,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:15,536 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] [2019-09-10 06:50:15,536 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1808799213, now seen corresponding path program 1 times [2019-09-10 06:50:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:15,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:15,592 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:50:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:15,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:15,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:15,594 INFO L87 Difference]: Start difference. First operand 214707 states and 265339 transitions. Second operand 3 states. [2019-09-10 06:50:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:16,141 INFO L93 Difference]: Finished difference Result 211925 states and 259777 transitions. [2019-09-10 06:50:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:16,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:50:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:16,360 INFO L225 Difference]: With dead ends: 211925 [2019-09-10 06:50:16,360 INFO L226 Difference]: Without dead ends: 211925 [2019-09-10 06:50:16,360 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:50:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211925 states. [2019-09-10 06:50:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211925 to 207422. [2019-09-10 06:50:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207422 states. [2019-09-10 06:50:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207422 states to 207422 states and 254300 transitions. [2019-09-10 06:50:19,687 INFO L78 Accepts]: Start accepts. Automaton has 207422 states and 254300 transitions. Word has length 110 [2019-09-10 06:50:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:19,687 INFO L475 AbstractCegarLoop]: Abstraction has 207422 states and 254300 transitions. [2019-09-10 06:50:19,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 207422 states and 254300 transitions. [2019-09-10 06:50:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:50:19,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:19,695 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] [2019-09-10 06:50:19,695 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2042896233, now seen corresponding path program 1 times [2019-09-10 06:50:19,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:19,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:19,825 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:50:19,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:19,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:19,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:19,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:19,826 INFO L87 Difference]: Start difference. First operand 207422 states and 254300 transitions. Second operand 9 states. [2019-09-10 06:50:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:22,049 INFO L93 Difference]: Finished difference Result 363188 states and 445610 transitions. [2019-09-10 06:50:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:50:22,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-10 06:50:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:22,423 INFO L225 Difference]: With dead ends: 363188 [2019-09-10 06:50:22,423 INFO L226 Difference]: Without dead ends: 363188 [2019-09-10 06:50:22,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:50:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363188 states. [2019-09-10 06:50:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363188 to 207366. [2019-09-10 06:50:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207366 states. [2019-09-10 06:50:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207366 states to 207366 states and 254238 transitions. [2019-09-10 06:50:26,480 INFO L78 Accepts]: Start accepts. Automaton has 207366 states and 254238 transitions. Word has length 110 [2019-09-10 06:50:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:26,480 INFO L475 AbstractCegarLoop]: Abstraction has 207366 states and 254238 transitions. [2019-09-10 06:50:26,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 207366 states and 254238 transitions. [2019-09-10 06:50:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:50:26,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:26,488 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] [2019-09-10 06:50:26,488 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1697576377, now seen corresponding path program 1 times [2019-09-10 06:50:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:26,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:26,544 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:50:26,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:26,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:26,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:26,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:26,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:26,547 INFO L87 Difference]: Start difference. First operand 207366 states and 254238 transitions. Second operand 3 states. [2019-09-10 06:50:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:27,197 INFO L93 Difference]: Finished difference Result 300742 states and 366835 transitions. [2019-09-10 06:50:27,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:27,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:50:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:28,342 INFO L225 Difference]: With dead ends: 300742 [2019-09-10 06:50:28,342 INFO L226 Difference]: Without dead ends: 300742 [2019-09-10 06:50:28,342 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:50:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300742 states. [2019-09-10 06:50:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300742 to 215450. [2019-09-10 06:50:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215450 states. [2019-09-10 06:50:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215450 states to 215450 states and 262762 transitions. [2019-09-10 06:50:32,035 INFO L78 Accepts]: Start accepts. Automaton has 215450 states and 262762 transitions. Word has length 110 [2019-09-10 06:50:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:32,035 INFO L475 AbstractCegarLoop]: Abstraction has 215450 states and 262762 transitions. [2019-09-10 06:50:32,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 215450 states and 262762 transitions. [2019-09-10 06:50:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:50:32,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:32,042 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] [2019-09-10 06:50:32,042 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1121732087, now seen corresponding path program 1 times [2019-09-10 06:50:32,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:32,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:32,262 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:50:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:32,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:32,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:50:32,263 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [335], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:50:32,264 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:32,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:32,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:32,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:32,451 INFO L272 AbstractInterpreter]: Visited 105 different actions 437 times. Merged at 38 different actions 302 times. Widened at 13 different actions 45 times. Performed 1819 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1819 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 14 different actions. Largest state had 238 variables. [2019-09-10 06:50:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:32,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:32,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:32,452 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:50:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:32,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:50:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:32,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:50:32,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:33,728 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:50:33,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:34,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:34,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:34,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:36,577 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 06:50:37,441 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:50:37,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:37,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 28 [2019-09-10 06:50:37,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:37,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:50:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:50:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:50:37,450 INFO L87 Difference]: Start difference. First operand 215450 states and 262762 transitions. Second operand 21 states. [2019-09-10 06:50:38,013 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:50:38,303 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:50:43,273 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 06:50:43,755 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:50:45,045 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-09-10 06:50:45,383 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:50:45,589 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:50:46,336 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:50:46,719 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:50:46,879 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:50:47,700 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:50:48,154 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:50:48,429 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:50:48,800 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:50:49,127 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:50:50,478 WARN L188 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:50:50,855 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:50:51,045 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:50:51,715 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:50:52,335 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:50:54,049 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:50:54,698 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:50:56,206 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:50:56,979 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:50:57,191 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:50:57,785 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:50:58,217 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:50:58,537 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:50:58,924 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 06:50:59,359 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:50:59,771 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:51:00,017 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:51:00,578 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-10 06:51:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:02,530 INFO L93 Difference]: Finished difference Result 721384 states and 862765 transitions. [2019-09-10 06:51:02,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 06:51:02,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-09-10 06:51:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:03,441 INFO L225 Difference]: With dead ends: 721384 [2019-09-10 06:51:03,441 INFO L226 Difference]: Without dead ends: 721384 [2019-09-10 06:51:03,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 179 SyntacticMatches, 24 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4786 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=2902, Invalid=11378, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 06:51:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721384 states. [2019-09-10 06:51:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721384 to 288839. [2019-09-10 06:51:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288839 states. [2019-09-10 06:51:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288839 states to 288839 states and 350952 transitions. [2019-09-10 06:51:13,835 INFO L78 Accepts]: Start accepts. Automaton has 288839 states and 350952 transitions. Word has length 110 [2019-09-10 06:51:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:13,835 INFO L475 AbstractCegarLoop]: Abstraction has 288839 states and 350952 transitions. [2019-09-10 06:51:13,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:51:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 288839 states and 350952 transitions. [2019-09-10 06:51:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:51:13,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:13,844 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] [2019-09-10 06:51:13,844 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash -130693552, now seen corresponding path program 1 times [2019-09-10 06:51:13,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:13,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:13,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:51:13,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:13,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:51:13,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:13,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:51:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:51:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:51:13,908 INFO L87 Difference]: Start difference. First operand 288839 states and 350952 transitions. Second operand 4 states. [2019-09-10 06:51:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:14,857 INFO L93 Difference]: Finished difference Result 354617 states and 430501 transitions. [2019-09-10 06:51:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:51:14,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:51:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:15,225 INFO L225 Difference]: With dead ends: 354617 [2019-09-10 06:51:15,225 INFO L226 Difference]: Without dead ends: 354617 [2019-09-10 06:51:15,225 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:51:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354617 states. [2019-09-10 06:51:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354617 to 288771. [2019-09-10 06:51:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288771 states. [2019-09-10 06:51:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288771 states to 288771 states and 350868 transitions. [2019-09-10 06:51:22,761 INFO L78 Accepts]: Start accepts. Automaton has 288771 states and 350868 transitions. Word has length 112 [2019-09-10 06:51:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:22,762 INFO L475 AbstractCegarLoop]: Abstraction has 288771 states and 350868 transitions. [2019-09-10 06:51:22,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:51:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 288771 states and 350868 transitions. [2019-09-10 06:51:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:51:22,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:22,770 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] [2019-09-10 06:51:22,770 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 505868363, now seen corresponding path program 1 times [2019-09-10 06:51:22,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:22,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:22,825 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:51:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:22,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:22,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:22,827 INFO L87 Difference]: Start difference. First operand 288771 states and 350868 transitions. Second operand 3 states. [2019-09-10 06:51:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:23,611 INFO L93 Difference]: Finished difference Result 297248 states and 360159 transitions. [2019-09-10 06:51:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:23,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:51:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:23,908 INFO L225 Difference]: With dead ends: 297248 [2019-09-10 06:51:23,908 INFO L226 Difference]: Without dead ends: 297248 [2019-09-10 06:51:23,908 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:51:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297248 states. [2019-09-10 06:51:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297248 to 296756. [2019-09-10 06:51:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296756 states. [2019-09-10 06:51:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296756 states to 296756 states and 359668 transitions. [2019-09-10 06:51:30,488 INFO L78 Accepts]: Start accepts. Automaton has 296756 states and 359668 transitions. Word has length 112 [2019-09-10 06:51:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:30,488 INFO L475 AbstractCegarLoop]: Abstraction has 296756 states and 359668 transitions. [2019-09-10 06:51:30,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 296756 states and 359668 transitions. [2019-09-10 06:51:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:51:30,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:30,496 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] [2019-09-10 06:51:30,496 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:30,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1466322329, now seen corresponding path program 1 times [2019-09-10 06:51:30,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:30,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:31,891 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:51:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:31,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:31,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:51:31,892 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], [76], [79], [82], [85], [89], [110], [113], [116], [129], [132], [135], [138], [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], [512], [515], [518], [521], [531], [534], [537], [541], [561], [700], [721], [749], [752], [755], [759], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:51:31,896 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:31,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:31,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:32,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:32,355 INFO L272 AbstractInterpreter]: Visited 107 different actions 563 times. Merged at 41 different actions 419 times. Widened at 16 different actions 80 times. Performed 2172 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 11 different actions. Largest state had 238 variables. [2019-09-10 06:51:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:32,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:32,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:32,355 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:51:32,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:32,372 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:51:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:32,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:51:32,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:32,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:32,988 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:51:32,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:33,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:33,315 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:51:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:33,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 10] total 33 [2019-09-10 06:51:33,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:33,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:51:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:51:33,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:51:33,321 INFO L87 Difference]: Start difference. First operand 296756 states and 359668 transitions. Second operand 27 states. [2019-09-10 06:51:33,695 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-09-10 06:51:36,590 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:51:36,838 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:51:37,184 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 06:51:38,054 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:51:38,471 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 06:51:38,737 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:51:41,778 WARN L188 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 06:51:42,283 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 06:51:42,951 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 06:51:43,171 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:51:43,643 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:51:43,902 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:51:44,761 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 06:51:45,192 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:51:46,680 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:51:48,269 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:51:48,619 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:51:48,929 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 06:51:51,909 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:51:52,229 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:51:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:55,809 INFO L93 Difference]: Finished difference Result 1279515 states and 1537098 transitions. [2019-09-10 06:51:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 06:51:55,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 112 [2019-09-10 06:51:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:57,430 INFO L225 Difference]: With dead ends: 1279515 [2019-09-10 06:51:57,431 INFO L226 Difference]: Without dead ends: 1279515 [2019-09-10 06:51:57,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1665, Invalid=8435, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 06:51:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279515 states. [2019-09-10 06:52:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279515 to 296804. [2019-09-10 06:52:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296804 states. [2019-09-10 06:52:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296804 states to 296804 states and 359716 transitions. [2019-09-10 06:52:14,646 INFO L78 Accepts]: Start accepts. Automaton has 296804 states and 359716 transitions. Word has length 112 [2019-09-10 06:52:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:14,646 INFO L475 AbstractCegarLoop]: Abstraction has 296804 states and 359716 transitions. [2019-09-10 06:52:14,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:52:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 296804 states and 359716 transitions. [2019-09-10 06:52:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:52:14,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:14,654 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] [2019-09-10 06:52:14,654 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash 925115211, now seen corresponding path program 1 times [2019-09-10 06:52:14,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:15,444 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-10 06:52:15,833 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:52:15,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:15,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:15,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:52:15,834 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [222], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:52:15,837 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:15,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:15,862 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:16,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:16,792 INFO L272 AbstractInterpreter]: Visited 107 different actions 502 times. Merged at 40 different actions 362 times. Widened at 16 different actions 62 times. Performed 2008 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 12 different actions. Largest state had 238 variables. [2019-09-10 06:52:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:16,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:16,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:16,792 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:52:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:16,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:52:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:52:16,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:17,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,571 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:52:17,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:17,944 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:52:17,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:52:17,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 32 [2019-09-10 06:52:17,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:52:17,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:52:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:52:17,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:52:17,950 INFO L87 Difference]: Start difference. First operand 296804 states and 359716 transitions. Second operand 24 states. [2019-09-10 06:52:18,112 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:52:18,959 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:52:19,399 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:52:19,599 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:52:19,827 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:52:20,069 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:52:20,381 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:52:21,046 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:52:21,609 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 06:52:21,872 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:52:22,275 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:52:22,450 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:52:22,893 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 06:52:23,063 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 06:52:23,383 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 06:52:26,298 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:52:26,767 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 06:52:27,240 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 06:52:27,588 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 06:52:28,018 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 06:52:28,454 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:52:28,862 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:52:29,488 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-09-10 06:52:30,175 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 06:52:30,769 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:52:31,019 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:52:31,362 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:52:31,598 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:52:32,088 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 06:52:32,522 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 06:52:32,823 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 06:52:33,127 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:52:33,488 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 06:52:33,943 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 06:52:34,362 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 06:52:34,815 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:52:35,477 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 06:52:35,908 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 06:52:36,401 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 06:52:36,732 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:52:36,963 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:52:37,336 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 06:52:37,797 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:52:38,274 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 06:52:38,618 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 06:52:38,956 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 06:52:39,367 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 06:52:39,767 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 06:52:40,296 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 06:52:40,687 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 06:52:41,110 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 06:52:41,483 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:52:41,776 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 06:52:42,455 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:42,870 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 06:52:43,223 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 06:52:43,808 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 06:52:44,306 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-09-10 06:52:44,685 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 06:52:45,086 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 06:52:45,446 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:52:45,915 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 06:52:46,382 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 06:52:46,737 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:52:47,268 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:47,779 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-09-10 06:52:48,156 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 06:52:48,673 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 06:52:48,941 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:52:49,528 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:52:49,871 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:52:50,085 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:52:50,546 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-09-10 06:52:50,946 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 06:52:51,281 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:52:51,620 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 06:52:51,892 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 06:52:52,138 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 06:52:52,382 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:52:52,821 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:52:53,280 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-09-10 06:52:53,776 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-10 06:52:54,245 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:52:54,695 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:52:55,071 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 06:52:55,395 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:52:55,649 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:52:56,002 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 06:52:56,379 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:52:56,654 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:52:57,094 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 06:52:57,429 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:52:58,109 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:52:58,430 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:52:58,730 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:52:59,018 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:52:59,302 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 06:52:59,570 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:53:00,177 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 06:53:00,594 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 06:53:00,887 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:53:01,214 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 06:53:01,685 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:53:02,078 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 06:53:02,452 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:53:02,790 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:53:03,226 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-10 06:53:03,577 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 06:53:04,137 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:53:04,562 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:53:04,852 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 06:53:05,188 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 06:53:05,599 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 06:53:05,996 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 06:53:06,418 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 06:53:06,879 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:53:07,297 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 06:53:07,834 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 06:53:08,105 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:53:08,500 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 06:53:08,856 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 06:53:09,172 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:53:09,623 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:53:09,830 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:53:10,064 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:53:10,375 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 06:53:10,772 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 06:53:10,976 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:53:11,271 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 06:53:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:12,760 INFO L93 Difference]: Finished difference Result 676856 states and 816882 transitions. [2019-09-10 06:53:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 06:53:12,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2019-09-10 06:53:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:13,600 INFO L225 Difference]: With dead ends: 676856 [2019-09-10 06:53:13,601 INFO L226 Difference]: Without dead ends: 676856 [2019-09-10 06:53:13,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10001 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=5944, Invalid=24856, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 06:53:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676856 states. [2019-09-10 06:53:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676856 to 296230. [2019-09-10 06:53:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296230 states. [2019-09-10 06:53:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296230 states to 296230 states and 358782 transitions. [2019-09-10 06:53:20,422 INFO L78 Accepts]: Start accepts. Automaton has 296230 states and 358782 transitions. Word has length 112 [2019-09-10 06:53:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:20,423 INFO L475 AbstractCegarLoop]: Abstraction has 296230 states and 358782 transitions. [2019-09-10 06:53:20,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:53:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 296230 states and 358782 transitions. [2019-09-10 06:53:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:53:20,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:20,431 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:53:20,431 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1297221371, now seen corresponding path program 1 times [2019-09-10 06:53:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:20,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:20,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:20,686 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:53:20,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:20,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:20,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:53:20,687 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], [76], [110], [113], [116], [119], [122], [125], [127], [129], [132], [135], [145], [148], [161], [164], [167], [171], [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], [509], [568], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:53:20,688 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:20,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:20,707 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:20,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:20,928 INFO L272 AbstractInterpreter]: Visited 108 different actions 484 times. Merged at 41 different actions 342 times. Widened at 14 different actions 53 times. Performed 1878 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 237 variables. [2019-09-10 06:53:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:20,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:20,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:20,929 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:53:20,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:20,943 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:53:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:21,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 06:53:21,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:21,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,541 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:53:21,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:21,922 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:53:21,935 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:53:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [11] total 27 [2019-09-10 06:53:21,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:21,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:53:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:53:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:53:21,936 INFO L87 Difference]: Start difference. First operand 296230 states and 358782 transitions. Second operand 10 states. [2019-09-10 06:53:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:25,094 INFO L93 Difference]: Finished difference Result 324648 states and 392058 transitions. [2019-09-10 06:53:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:53:25,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:53:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:25,466 INFO L225 Difference]: With dead ends: 324648 [2019-09-10 06:53:25,466 INFO L226 Difference]: Without dead ends: 324648 [2019-09-10 06:53:25,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:53:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324648 states. [2019-09-10 06:53:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324648 to 315726. [2019-09-10 06:53:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315726 states. [2019-09-10 06:53:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315726 states to 315726 states and 382050 transitions. [2019-09-10 06:53:35,178 INFO L78 Accepts]: Start accepts. Automaton has 315726 states and 382050 transitions. Word has length 113 [2019-09-10 06:53:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:35,178 INFO L475 AbstractCegarLoop]: Abstraction has 315726 states and 382050 transitions. [2019-09-10 06:53:35,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:53:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 315726 states and 382050 transitions. [2019-09-10 06:53:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:53:35,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:35,186 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:53:35,186 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash -936777338, now seen corresponding path program 1 times [2019-09-10 06:53:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:35,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:35,511 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:53:35,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:35,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:53:35,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:35,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:53:35,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:53:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:53:35,513 INFO L87 Difference]: Start difference. First operand 315726 states and 382050 transitions. Second operand 10 states. [2019-09-10 06:53:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:37,075 INFO L93 Difference]: Finished difference Result 535165 states and 649027 transitions. [2019-09-10 06:53:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:53:37,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:53:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:38,973 INFO L225 Difference]: With dead ends: 535165 [2019-09-10 06:53:38,973 INFO L226 Difference]: Without dead ends: 535165 [2019-09-10 06:53:38,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:53:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535165 states. [2019-09-10 06:53:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535165 to 310238. [2019-09-10 06:53:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310238 states. [2019-09-10 06:53:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310238 states to 310238 states and 375514 transitions. [2019-09-10 06:53:49,294 INFO L78 Accepts]: Start accepts. Automaton has 310238 states and 375514 transitions. Word has length 113 [2019-09-10 06:53:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:49,294 INFO L475 AbstractCegarLoop]: Abstraction has 310238 states and 375514 transitions. [2019-09-10 06:53:49,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:53:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 310238 states and 375514 transitions. [2019-09-10 06:53:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:53:49,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:49,303 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:53:49,303 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1500858457, now seen corresponding path program 1 times [2019-09-10 06:53:49,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:49,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:49,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:49,363 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:53:49,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:49,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:53:49,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:49,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:53:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:53:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:53:49,364 INFO L87 Difference]: Start difference. First operand 310238 states and 375514 transitions. Second operand 4 states. [2019-09-10 06:53:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:50,278 INFO L93 Difference]: Finished difference Result 332431 states and 401580 transitions. [2019-09-10 06:53:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:50,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 06:53:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:50,654 INFO L225 Difference]: With dead ends: 332431 [2019-09-10 06:53:50,655 INFO L226 Difference]: Without dead ends: 332431 [2019-09-10 06:53:50,655 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:53:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332431 states. [2019-09-10 06:53:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332431 to 309975. [2019-09-10 06:53:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309975 states. [2019-09-10 06:53:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309975 states to 309975 states and 375205 transitions. [2019-09-10 06:53:58,789 INFO L78 Accepts]: Start accepts. Automaton has 309975 states and 375205 transitions. Word has length 113 [2019-09-10 06:53:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 309975 states and 375205 transitions. [2019-09-10 06:53:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:53:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 309975 states and 375205 transitions. [2019-09-10 06:53:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:53:58,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:58,797 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:53:58,797 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -955355422, now seen corresponding path program 1 times [2019-09-10 06:53:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:58,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:59,137 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:53:59,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:59,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:59,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:53:59,138 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], [76], [79], [82], [85], [89], [110], [113], [116], [129], [132], [135], [138], [141], [143], [145], [148], [151], [161], [164], [167], [171], [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], [507], [700], [721], [749], [752], [755], [759], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:53:59,141 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:59,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:59,193 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:59,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:59,437 INFO L272 AbstractInterpreter]: Visited 108 different actions 450 times. Merged at 41 different actions 312 times. Widened at 12 different actions 45 times. Performed 1814 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1814 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 237 variables. [2019-09-10 06:53:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:59,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:59,438 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:59,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:53:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:53:59,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:59,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,051 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:54:00,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:00,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:00,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:01,037 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:54:01,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:01,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2019-09-10 06:54:01,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:01,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:54:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:54:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:54:01,043 INFO L87 Difference]: Start difference. First operand 309975 states and 375205 transitions. Second operand 24 states. [2019-09-10 06:54:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:10,052 INFO L93 Difference]: Finished difference Result 679847 states and 817603 transitions. [2019-09-10 06:54:10,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:54:10,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-09-10 06:54:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:10,857 INFO L225 Difference]: With dead ends: 679847 [2019-09-10 06:54:10,857 INFO L226 Difference]: Without dead ends: 679847 [2019-09-10 06:54:10,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=382, Invalid=1874, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:54:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679847 states. [2019-09-10 06:54:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679847 to 310003. [2019-09-10 06:54:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310003 states. [2019-09-10 06:54:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310003 states to 310003 states and 375233 transitions. [2019-09-10 06:54:15,880 INFO L78 Accepts]: Start accepts. Automaton has 310003 states and 375233 transitions. Word has length 113 [2019-09-10 06:54:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:15,880 INFO L475 AbstractCegarLoop]: Abstraction has 310003 states and 375233 transitions. [2019-09-10 06:54:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:54:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 310003 states and 375233 transitions. [2019-09-10 06:54:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:54:15,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:15,888 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:54:15,888 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1870222915, now seen corresponding path program 1 times [2019-09-10 06:54:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:15,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:15,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:17,484 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:54:17,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:17,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:17,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:54:17,485 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], [76], [110], [113], [116], [119], [122], [127], [129], [132], [135], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [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], [386], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [509], [568], [573], [696], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:54:17,488 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:17,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:17,509 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:17,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:17,677 INFO L272 AbstractInterpreter]: Visited 110 different actions 425 times. Merged at 42 different actions 291 times. Widened at 13 different actions 34 times. Performed 1717 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1717 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 10 different actions. Largest state had 237 variables. [2019-09-10 06:54:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:17,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:17,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:17,678 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:17,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:17,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:17,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:54:17,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,363 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:54:18,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:18,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:18,718 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 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:54:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:54:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [20] total 37 [2019-09-10 06:54:18,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:18,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:54:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:54:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:54:18,734 INFO L87 Difference]: Start difference. First operand 310003 states and 375233 transitions. Second operand 11 states. [2019-09-10 06:54:20,105 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:54:20,257 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:54:20,567 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:54:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:21,174 INFO L93 Difference]: Finished difference Result 309102 states and 373250 transitions. [2019-09-10 06:54:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:54:21,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-10 06:54:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:22,504 INFO L225 Difference]: With dead ends: 309102 [2019-09-10 06:54:22,504 INFO L226 Difference]: Without dead ends: 309102 [2019-09-10 06:54:22,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:54:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309102 states. [2019-09-10 06:54:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309102 to 301659. [2019-09-10 06:54:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301659 states. [2019-09-10 06:54:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301659 states to 301659 states and 364911 transitions. [2019-09-10 06:54:32,829 INFO L78 Accepts]: Start accepts. Automaton has 301659 states and 364911 transitions. Word has length 115 [2019-09-10 06:54:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:32,829 INFO L475 AbstractCegarLoop]: Abstraction has 301659 states and 364911 transitions. [2019-09-10 06:54:32,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:54:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 301659 states and 364911 transitions. [2019-09-10 06:54:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:54:32,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:32,837 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:54:32,838 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:32,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1701660697, now seen corresponding path program 1 times [2019-09-10 06:54:32,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:32,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:33,163 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:54:33,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:33,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:33,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:54:33,164 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], [76], [79], [82], [85], [89], [110], [113], [116], [129], [132], [135], [138], [143], [145], [148], [151], [161], [164], [167], [171], [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], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [507], [512], [566], [700], [721], [749], [752], [755], [759], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:54:33,167 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:33,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:33,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:33,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:33,383 INFO L272 AbstractInterpreter]: Visited 110 different actions 392 times. Merged at 42 different actions 259 times. Widened at 13 different actions 29 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 23 fixpoints after 11 different actions. Largest state had 237 variables. [2019-09-10 06:54:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:33,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:33,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:33,384 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:54:33,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:33,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:33,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:54:33,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:36,124 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:54:36,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:36,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:36,348 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:54:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 27 [2019-09-10 06:54:36,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:36,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:54:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:54:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:54:36,355 INFO L87 Difference]: Start difference. First operand 301659 states and 364911 transitions. Second operand 24 states. [2019-09-10 06:54:40,062 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 06:54:40,605 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 06:54:41,279 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:54:41,723 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:54:42,407 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:54:42,877 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:54:43,720 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 06:54:44,422 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:54:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:46,293 INFO L93 Difference]: Finished difference Result 510848 states and 619247 transitions. [2019-09-10 06:54:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:54:46,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 115 [2019-09-10 06:54:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:47,614 INFO L225 Difference]: With dead ends: 510848 [2019-09-10 06:54:47,615 INFO L226 Difference]: Without dead ends: 510848 [2019-09-10 06:54:47,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 200 SyntacticMatches, 20 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=322, Invalid=1840, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:54:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510848 states. [2019-09-10 06:54:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510848 to 301671. [2019-09-10 06:54:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301671 states. [2019-09-10 06:54:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301671 states to 301671 states and 364923 transitions. [2019-09-10 06:54:52,726 INFO L78 Accepts]: Start accepts. Automaton has 301671 states and 364923 transitions. Word has length 115 [2019-09-10 06:54:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:52,727 INFO L475 AbstractCegarLoop]: Abstraction has 301671 states and 364923 transitions. [2019-09-10 06:54:52,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:54:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 301671 states and 364923 transitions. [2019-09-10 06:54:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:54:52,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:52,735 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:54:52,736 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1546931066, now seen corresponding path program 1 times [2019-09-10 06:54:52,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:52,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:53,273 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:54:53,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:53,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:53,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:54:53,274 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], [76], [79], [82], [85], [89], [92], [95], [98], [101], [104], [108], [110], [113], [116], [119], [122], [125], [127], [129], [132], [135], [138], [141], [143], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [324], [335], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [488], [491], [494], [497], [501], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:54:53,276 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:53,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:53,301 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:53,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:53,497 INFO L272 AbstractInterpreter]: Visited 111 different actions 464 times. Merged at 39 different actions 322 times. Widened at 15 different actions 53 times. Performed 1940 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1940 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 14 different actions. Largest state had 238 variables. [2019-09-10 06:54:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:53,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:53,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:53,498 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:53,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:53,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:53,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:54:53,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,276 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:54:54,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:54,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:54,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:56,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:54:56,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:56,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 34 [2019-09-10 06:54:56,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:56,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:54:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:54:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:54:56,560 INFO L87 Difference]: Start difference. First operand 301671 states and 364923 transitions. Second operand 28 states. [2019-09-10 06:55:00,365 WARN L188 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 06:55:01,410 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 06:55:02,064 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:55:02,592 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:55:03,283 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:55:03,702 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:55:04,355 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 06:55:04,657 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:55:05,352 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:55:05,863 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 06:55:06,290 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:55:06,592 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:55:07,042 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:55:07,412 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:55:07,997 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 06:55:08,486 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 06:55:08,782 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:55:09,188 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:55:09,449 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:55:09,939 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:55:10,294 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:55:10,871 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:55:11,407 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:55:11,957 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:55:12,334 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:55:12,610 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:55:12,826 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:55:13,138 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 06:55:13,584 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:55:14,063 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:55:14,581 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 06:55:15,124 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:55:15,364 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:55:15,660 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 06:55:16,018 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 06:55:16,588 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:17,021 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:55:17,584 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:55:18,457 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:55:18,772 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:55:19,090 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 06:55:19,365 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:55:19,841 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 06:55:20,165 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 06:55:20,685 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:55:21,042 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 06:55:21,415 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 06:55:21,816 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 06:55:22,111 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:55:22,409 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:55:22,848 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:55:23,084 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 06:55:23,644 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:55:24,212 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 06:55:24,724 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 06:55:25,246 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:55:25,641 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 06:55:26,161 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:55:26,733 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 06:55:27,058 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:55:27,496 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:55:27,938 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:55:28,481 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:55:28,909 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:55:29,504 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:55:29,738 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:55:30,215 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:55:30,472 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:55:30,966 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 06:55:31,301 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 06:55:31,858 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 06:55:32,307 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:55:32,577 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 06:55:32,954 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:55:33,417 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:55:33,702 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:55:34,237 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 06:55:34,593 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 06:55:34,819 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:55:35,029 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:55:35,345 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:55:35,621 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:55:36,037 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:55:36,431 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 06:55:36,752 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 06:55:37,290 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:37,681 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:55:38,100 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:55:38,288 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:55:38,656 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:55:38,980 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:55:39,352 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:55:39,588 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:55:39,951 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:55:40,471 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 06:55:41,022 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:55:41,472 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:55:41,887 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:55:42,354 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:42,771 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 06:55:43,350 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:43,721 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:55:44,073 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 06:55:44,470 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 06:55:44,849 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 06:55:45,254 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 06:55:45,653 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:55:45,962 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 06:55:46,239 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 06:55:46,590 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:55:46,991 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:55:47,250 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:55:47,588 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 06:55:48,031 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:55:48,287 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:55:48,537 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:55:48,947 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 06:55:49,532 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 06:55:49,995 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 06:55:50,416 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 06:55:50,757 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 06:55:51,127 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 06:55:51,646 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 06:55:52,074 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:52,328 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:55:53,562 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 06:55:54,041 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 06:55:54,674 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 06:55:55,101 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:55:55,455 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:55:55,994 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 06:55:56,423 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 06:55:56,824 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:55:57,506 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 06:55:58,202 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:55:58,892 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 06:55:59,521 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 06:56:00,860 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:56:01,390 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:56:02,167 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 06:56:02,641 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:56:03,023 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:56:03,415 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 06:56:04,081 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:56:04,717 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:56:05,166 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:56:05,530 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 06:56:06,128 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:56:07,217 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:56:07,582 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 06:56:08,309 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 06:56:08,988 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:56:09,970 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:56:10,311 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 06:56:10,745 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:56:11,212 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:56:11,725 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 06:56:12,094 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 06:56:12,982 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 06:56:13,413 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:56:14,046 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 06:56:14,346 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:56:14,711 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:56:15,354 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:56:15,683 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 06:56:16,275 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 06:56:16,787 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:56:17,174 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:56:17,540 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 06:56:17,992 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:56:18,276 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:56:18,666 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:56:19,048 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 06:56:19,819 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 06:56:20,136 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 06:56:20,518 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:56:21,516 WARN L188 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 06:56:21,828 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:56:22,317 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 06:56:22,650 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:56:22,942 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:56:23,290 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:56:23,838 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 06:56:24,344 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 06:56:24,661 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:56:25,043 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:56:25,445 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:56:25,949 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:56:26,255 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:56:26,748 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 06:56:27,051 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 06:56:27,536 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:56:27,873 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 06:56:28,371 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:56:29,018 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:56:29,390 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:56:29,665 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:56:30,004 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:56:30,625 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 06:56:31,006 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 06:56:31,328 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:56:31,818 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 06:56:32,182 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:56:32,567 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 06:56:33,081 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 06:56:33,536 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:56:34,051 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 06:56:34,520 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-09-10 06:56:34,941 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:56:35,354 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:56:35,892 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:56:36,594 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 06:56:37,043 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:56:37,315 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:56:37,899 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:56:38,226 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:56:38,538 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:56:38,904 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 06:56:39,187 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:56:39,554 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 06:56:39,826 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:56:40,103 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:56:40,598 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:56:40,987 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:56:41,440 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 06:56:41,797 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:56:42,219 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 06:56:42,606 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:56:43,044 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:56:43,682 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:56:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:45,622 INFO L93 Difference]: Finished difference Result 751751 states and 903345 transitions. [2019-09-10 06:56:45,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-09-10 06:56:45,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 116 [2019-09-10 06:56:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:46,512 INFO L225 Difference]: With dead ends: 751751 [2019-09-10 06:56:46,513 INFO L226 Difference]: Without dead ends: 751751 [2019-09-10 06:56:46,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 201 SyntacticMatches, 16 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28882 ImplicationChecksByTransitivity, 90.4s TimeCoverageRelationStatistics Valid=10781, Invalid=61311, Unknown=0, NotChecked=0, Total=72092 [2019-09-10 06:56:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751751 states. [2019-09-10 06:56:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751751 to 310099. [2019-09-10 06:56:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310099 states. [2019-09-10 06:56:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310099 states to 310099 states and 374911 transitions. [2019-09-10 06:56:53,235 INFO L78 Accepts]: Start accepts. Automaton has 310099 states and 374911 transitions. Word has length 116 [2019-09-10 06:56:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:53,236 INFO L475 AbstractCegarLoop]: Abstraction has 310099 states and 374911 transitions. [2019-09-10 06:56:53,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:56:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 310099 states and 374911 transitions. [2019-09-10 06:56:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:56:53,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:53,243 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] [2019-09-10 06:56:53,243 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1542711847, now seen corresponding path program 1 times [2019-09-10 06:56:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:53,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:53,371 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:56:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:53,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:53,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:53,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:53,372 INFO L87 Difference]: Start difference. First operand 310099 states and 374911 transitions. Second operand 9 states. [2019-09-10 06:56:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:56,410 INFO L93 Difference]: Finished difference Result 538002 states and 647902 transitions. [2019-09-10 06:56:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:56:56,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 06:56:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:57,037 INFO L225 Difference]: With dead ends: 538002 [2019-09-10 06:56:57,037 INFO L226 Difference]: Without dead ends: 538002 [2019-09-10 06:56:57,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:56:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538002 states. [2019-09-10 06:57:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538002 to 309706. [2019-09-10 06:57:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309706 states. [2019-09-10 06:57:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309706 states to 309706 states and 374482 transitions. [2019-09-10 06:57:09,919 INFO L78 Accepts]: Start accepts. Automaton has 309706 states and 374482 transitions. Word has length 117 [2019-09-10 06:57:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:09,919 INFO L475 AbstractCegarLoop]: Abstraction has 309706 states and 374482 transitions. [2019-09-10 06:57:09,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:57:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 309706 states and 374482 transitions. [2019-09-10 06:57:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:57:09,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:09,929 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:57:09,929 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 435300890, now seen corresponding path program 1 times [2019-09-10 06:57:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:09,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:09,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:11,128 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:57:11,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:11,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:11,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:57:11,129 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], [76], [79], [82], [85], [89], [92], [95], [98], [101], [104], [108], [110], [113], [116], [119], [122], [125], [127], [129], [132], [135], [138], [141], [143], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [222], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [488], [491], [494], [497], [501], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:57:11,132 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:11,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:11,161 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:11,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:11,416 INFO L272 AbstractInterpreter]: Visited 113 different actions 461 times. Merged at 41 different actions 320 times. Widened at 14 different actions 43 times. Performed 1919 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1919 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 12 different actions. Largest state had 238 variables. [2019-09-10 06:57:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:11,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:11,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:11,417 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:57:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:11,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)