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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:12:02,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:12:02,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:12:02,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:12:02,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:12:02,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:12:02,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:12:02,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:12:02,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:12:02,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:12:02,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:12:02,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:12:02,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:12:02,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:12:02,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:12:02,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:12:02,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:12:02,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:12:02,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:12:02,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:12:02,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:12:02,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:12:02,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:12:02,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:12:02,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:12:02,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:12:02,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:12:02,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:12:02,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:12:02,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:12:02,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:12:02,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:12:02,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:12:02,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:12:02,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:12:02,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:12:02,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:12:02,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:12:02,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:12:02,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:12:02,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:12:02,691 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:12:02,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:12:02,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:12:02,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:12:02,708 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:12:02,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:12:02,709 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:12:02,710 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:12:02,710 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:12:02,710 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:12:02,710 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:12:02,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:12:02,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:12:02,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:12:02,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:12:02,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:12:02,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:12:02,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:12:02,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:12:02,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:12:02,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:12:02,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:12:02,713 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:12:02,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:12:02,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:12:02,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:12:02,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:12:02,715 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:12:02,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:12:02,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:12:02,715 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:12:02,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:12:02,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:12:02,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:12:02,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:12:02,786 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:12:02,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:12:02,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d923d2ba/7c753c5d98c544249717a7ca04056fbd/FLAGa57514231 [2019-09-10 06:12:03,487 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:12:03,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:12:03,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d923d2ba/7c753c5d98c544249717a7ca04056fbd/FLAGa57514231 [2019-09-10 06:12:03,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d923d2ba/7c753c5d98c544249717a7ca04056fbd [2019-09-10 06:12:03,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:12:03,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:12:03,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:03,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:12:03,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:12:03,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:03" (1/1) ... [2019-09-10 06:12:03,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744228c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:03, skipping insertion in model container [2019-09-10 06:12:03,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:03" (1/1) ... [2019-09-10 06:12:03,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:12:03,845 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:12:04,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:04,377 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:12:04,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:04,579 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:12:04,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04 WrapperNode [2019-09-10 06:12:04,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:04,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:12:04,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:12:04,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:12:04,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (1/1) ... [2019-09-10 06:12:04,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:12:04,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:12:04,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:12:04,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:12:04,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (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:12:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:12:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:12:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:12:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:12:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:12:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:12:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:12:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:12:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:12:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:12:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:12:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:12:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:12:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:12:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:12:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:12:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:12:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:12:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:12:06,397 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:12:06,398 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:12:06,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:06 BoogieIcfgContainer [2019-09-10 06:12:06,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:12:06,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:12:06,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:12:06,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:12:06,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:12:03" (1/3) ... [2019-09-10 06:12:06,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2815b057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:06, skipping insertion in model container [2019-09-10 06:12:06,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:04" (2/3) ... [2019-09-10 06:12:06,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2815b057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:06, skipping insertion in model container [2019-09-10 06:12:06,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:06" (3/3) ... [2019-09-10 06:12:06,414 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:12:06,427 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:12:06,451 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:12:06,472 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:12:06,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:12:06,506 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:12:06,507 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:12:06,507 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:12:06,507 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:12:06,507 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:12:06,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:12:06,507 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:12:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2019-09-10 06:12:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:12:06,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:06,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:06,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1302901501, now seen corresponding path program 1 times [2019-09-10 06:12:06,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:06,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:07,217 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:12:07,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:07,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:07,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:07,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:07,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:07,245 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2019-09-10 06:12:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:07,358 INFO L93 Difference]: Finished difference Result 432 states and 746 transitions. [2019-09-10 06:12:07,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:07,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:12:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:07,379 INFO L225 Difference]: With dead ends: 432 [2019-09-10 06:12:07,379 INFO L226 Difference]: Without dead ends: 424 [2019-09-10 06:12:07,381 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:12:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-10 06:12:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2019-09-10 06:12:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-10 06:12:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 706 transitions. [2019-09-10 06:12:07,459 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 706 transitions. Word has length 103 [2019-09-10 06:12:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:07,460 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 706 transitions. [2019-09-10 06:12:07,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 706 transitions. [2019-09-10 06:12:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:12:07,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:07,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:07,464 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1878169074, now seen corresponding path program 1 times [2019-09-10 06:12:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:07,739 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:12:07,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:07,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:07,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:07,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:07,744 INFO L87 Difference]: Start difference. First operand 422 states and 706 transitions. Second operand 3 states. [2019-09-10 06:12:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:07,802 INFO L93 Difference]: Finished difference Result 645 states and 1075 transitions. [2019-09-10 06:12:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:07,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 06:12:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:07,809 INFO L225 Difference]: With dead ends: 645 [2019-09-10 06:12:07,809 INFO L226 Difference]: Without dead ends: 645 [2019-09-10 06:12:07,810 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:12:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-10 06:12:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2019-09-10 06:12:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-10 06:12:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1074 transitions. [2019-09-10 06:12:07,860 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1074 transitions. Word has length 106 [2019-09-10 06:12:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:07,861 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1074 transitions. [2019-09-10 06:12:07,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1074 transitions. [2019-09-10 06:12:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:12:07,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:07,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:07,869 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash -769887869, now seen corresponding path program 1 times [2019-09-10 06:12:07,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:08,054 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:12:08,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:08,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:08,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:08,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:08,060 INFO L87 Difference]: Start difference. First operand 643 states and 1074 transitions. Second operand 3 states. [2019-09-10 06:12:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:08,097 INFO L93 Difference]: Finished difference Result 1069 states and 1775 transitions. [2019-09-10 06:12:08,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:08,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 06:12:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:08,109 INFO L225 Difference]: With dead ends: 1069 [2019-09-10 06:12:08,109 INFO L226 Difference]: Without dead ends: 1069 [2019-09-10 06:12:08,110 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:12:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-09-10 06:12:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067. [2019-09-10 06:12:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-09-10 06:12:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1774 transitions. [2019-09-10 06:12:08,149 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1774 transitions. Word has length 109 [2019-09-10 06:12:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:08,151 INFO L475 AbstractCegarLoop]: Abstraction has 1067 states and 1774 transitions. [2019-09-10 06:12:08,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1774 transitions. [2019-09-10 06:12:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:12:08,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:08,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:08,155 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 491698056, now seen corresponding path program 1 times [2019-09-10 06:12:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:08,300 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:12:08,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:08,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:08,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:08,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:08,303 INFO L87 Difference]: Start difference. First operand 1067 states and 1774 transitions. Second operand 3 states. [2019-09-10 06:12:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:08,348 INFO L93 Difference]: Finished difference Result 1881 states and 3103 transitions. [2019-09-10 06:12:08,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:08,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:12:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:08,361 INFO L225 Difference]: With dead ends: 1881 [2019-09-10 06:12:08,361 INFO L226 Difference]: Without dead ends: 1881 [2019-09-10 06:12:08,362 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:12:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-09-10 06:12:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1879. [2019-09-10 06:12:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-09-10 06:12:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 3102 transitions. [2019-09-10 06:12:08,417 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 3102 transitions. Word has length 112 [2019-09-10 06:12:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:08,418 INFO L475 AbstractCegarLoop]: Abstraction has 1879 states and 3102 transitions. [2019-09-10 06:12:08,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 3102 transitions. [2019-09-10 06:12:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:12:08,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:08,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,422 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:08,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2126778359, now seen corresponding path program 1 times [2019-09-10 06:12:08,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:08,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:08,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:08,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:08,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:08,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:08,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:08,717 INFO L87 Difference]: Start difference. First operand 1879 states and 3102 transitions. Second operand 6 states. [2019-09-10 06:12:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:09,145 INFO L93 Difference]: Finished difference Result 7904 states and 13133 transitions. [2019-09-10 06:12:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:12:09,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-10 06:12:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:09,188 INFO L225 Difference]: With dead ends: 7904 [2019-09-10 06:12:09,189 INFO L226 Difference]: Without dead ends: 7904 [2019-09-10 06:12:09,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:12:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2019-09-10 06:12:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 3488. [2019-09-10 06:12:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-09-10 06:12:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 5743 transitions. [2019-09-10 06:12:09,433 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 5743 transitions. Word has length 115 [2019-09-10 06:12:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:09,434 INFO L475 AbstractCegarLoop]: Abstraction has 3488 states and 5743 transitions. [2019-09-10 06:12:09,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 5743 transitions. [2019-09-10 06:12:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:09,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:09,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:09,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1571788028, now seen corresponding path program 1 times [2019-09-10 06:12:09,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:09,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:09,667 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:12:09,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:09,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:09,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:09,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:09,670 INFO L87 Difference]: Start difference. First operand 3488 states and 5743 transitions. Second operand 4 states. [2019-09-10 06:12:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:09,785 INFO L93 Difference]: Finished difference Result 6070 states and 10050 transitions. [2019-09-10 06:12:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:09,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 06:12:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:09,816 INFO L225 Difference]: With dead ends: 6070 [2019-09-10 06:12:09,817 INFO L226 Difference]: Without dead ends: 6070 [2019-09-10 06:12:09,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6070 states. [2019-09-10 06:12:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6070 to 5159. [2019-09-10 06:12:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-10 06:12:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 8514 transitions. [2019-09-10 06:12:09,984 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 8514 transitions. Word has length 116 [2019-09-10 06:12:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:09,985 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 8514 transitions. [2019-09-10 06:12:09,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 8514 transitions. [2019-09-10 06:12:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:09,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:09,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:09,991 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash -190610616, now seen corresponding path program 1 times [2019-09-10 06:12:09,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:10,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:10,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:10,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:10,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:10,092 INFO L87 Difference]: Start difference. First operand 5159 states and 8514 transitions. Second operand 3 states. [2019-09-10 06:12:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:10,159 INFO L93 Difference]: Finished difference Result 7659 states and 12607 transitions. [2019-09-10 06:12:10,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:10,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:12:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:10,212 INFO L225 Difference]: With dead ends: 7659 [2019-09-10 06:12:10,213 INFO L226 Difference]: Without dead ends: 7659 [2019-09-10 06:12:10,214 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:12:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2019-09-10 06:12:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 7657. [2019-09-10 06:12:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7657 states. [2019-09-10 06:12:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7657 states to 7657 states and 12606 transitions. [2019-09-10 06:12:10,560 INFO L78 Accepts]: Start accepts. Automaton has 7657 states and 12606 transitions. Word has length 116 [2019-09-10 06:12:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:10,561 INFO L475 AbstractCegarLoop]: Abstraction has 7657 states and 12606 transitions. [2019-09-10 06:12:10,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7657 states and 12606 transitions. [2019-09-10 06:12:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:10,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:10,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:10,565 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1210538184, now seen corresponding path program 1 times [2019-09-10 06:12:10,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:10,657 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:12:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:10,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:10,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:10,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:10,659 INFO L87 Difference]: Start difference. First operand 7657 states and 12606 transitions. Second operand 3 states. [2019-09-10 06:12:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:10,722 INFO L93 Difference]: Finished difference Result 10393 states and 17063 transitions. [2019-09-10 06:12:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:10,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:12:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:10,747 INFO L225 Difference]: With dead ends: 10393 [2019-09-10 06:12:10,748 INFO L226 Difference]: Without dead ends: 10393 [2019-09-10 06:12:10,748 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:12:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2019-09-10 06:12:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 10391. [2019-09-10 06:12:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10391 states. [2019-09-10 06:12:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10391 states to 10391 states and 17062 transitions. [2019-09-10 06:12:10,960 INFO L78 Accepts]: Start accepts. Automaton has 10391 states and 17062 transitions. Word has length 116 [2019-09-10 06:12:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:10,960 INFO L475 AbstractCegarLoop]: Abstraction has 10391 states and 17062 transitions. [2019-09-10 06:12:10,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 10391 states and 17062 transitions. [2019-09-10 06:12:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:10,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:10,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:10,963 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1227020200, now seen corresponding path program 1 times [2019-09-10 06:12:10,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:11,049 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:12:11,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:11,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:11,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:11,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:11,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:11,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:11,050 INFO L87 Difference]: Start difference. First operand 10391 states and 17062 transitions. Second operand 3 states. [2019-09-10 06:12:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:11,116 INFO L93 Difference]: Finished difference Result 14111 states and 23148 transitions. [2019-09-10 06:12:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:11,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:12:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,253 INFO L225 Difference]: With dead ends: 14111 [2019-09-10 06:12:11,254 INFO L226 Difference]: Without dead ends: 14111 [2019-09-10 06:12:11,254 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:12:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14111 states. [2019-09-10 06:12:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14111 to 14109. [2019-09-10 06:12:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14109 states. [2019-09-10 06:12:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14109 states to 14109 states and 23147 transitions. [2019-09-10 06:12:11,515 INFO L78 Accepts]: Start accepts. Automaton has 14109 states and 23147 transitions. Word has length 116 [2019-09-10 06:12:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:11,516 INFO L475 AbstractCegarLoop]: Abstraction has 14109 states and 23147 transitions. [2019-09-10 06:12:11,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14109 states and 23147 transitions. [2019-09-10 06:12:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:11,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:11,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:11,518 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:11,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1410050920, now seen corresponding path program 1 times [2019-09-10 06:12:11,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:11,603 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:12:11,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:11,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:11,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:11,606 INFO L87 Difference]: Start difference. First operand 14109 states and 23147 transitions. Second operand 3 states. [2019-09-10 06:12:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:11,684 INFO L93 Difference]: Finished difference Result 20829 states and 34242 transitions. [2019-09-10 06:12:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:11,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:12:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,735 INFO L225 Difference]: With dead ends: 20829 [2019-09-10 06:12:11,735 INFO L226 Difference]: Without dead ends: 20829 [2019-09-10 06:12:11,736 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:12:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2019-09-10 06:12:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 20827. [2019-09-10 06:12:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20827 states. [2019-09-10 06:12:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20827 states to 20827 states and 34241 transitions. [2019-09-10 06:12:12,623 INFO L78 Accepts]: Start accepts. Automaton has 20827 states and 34241 transitions. Word has length 116 [2019-09-10 06:12:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:12,624 INFO L475 AbstractCegarLoop]: Abstraction has 20827 states and 34241 transitions. [2019-09-10 06:12:12,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20827 states and 34241 transitions. [2019-09-10 06:12:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:12:12,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:12,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:12,626 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1542398928, now seen corresponding path program 1 times [2019-09-10 06:12:12,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:12,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:12,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:12,730 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:12:12,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:12,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:12,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:12,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:12,732 INFO L87 Difference]: Start difference. First operand 20827 states and 34241 transitions. Second operand 4 states. [2019-09-10 06:12:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:12,920 INFO L93 Difference]: Finished difference Result 40339 states and 66347 transitions. [2019-09-10 06:12:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:12,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-10 06:12:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:13,020 INFO L225 Difference]: With dead ends: 40339 [2019-09-10 06:12:13,020 INFO L226 Difference]: Without dead ends: 40339 [2019-09-10 06:12:13,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40339 states. [2019-09-10 06:12:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40339 to 33908. [2019-09-10 06:12:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33908 states. [2019-09-10 06:12:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33908 states to 33908 states and 55591 transitions. [2019-09-10 06:12:13,841 INFO L78 Accepts]: Start accepts. Automaton has 33908 states and 55591 transitions. Word has length 117 [2019-09-10 06:12:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:13,841 INFO L475 AbstractCegarLoop]: Abstraction has 33908 states and 55591 transitions. [2019-09-10 06:12:13,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33908 states and 55591 transitions. [2019-09-10 06:12:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:12:13,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:13,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:13,846 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -626778805, now seen corresponding path program 1 times [2019-09-10 06:12:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:13,951 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:12:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:13,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:13,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:13,953 INFO L87 Difference]: Start difference. First operand 33908 states and 55591 transitions. Second operand 4 states. [2019-09-10 06:12:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:14,214 INFO L93 Difference]: Finished difference Result 64902 states and 106461 transitions. [2019-09-10 06:12:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:14,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-10 06:12:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:14,344 INFO L225 Difference]: With dead ends: 64902 [2019-09-10 06:12:14,344 INFO L226 Difference]: Without dead ends: 64902 [2019-09-10 06:12:14,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64902 states. [2019-09-10 06:12:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64902 to 54897. [2019-09-10 06:12:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54897 states. [2019-09-10 06:12:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54897 states to 54897 states and 89749 transitions. [2019-09-10 06:12:16,213 INFO L78 Accepts]: Start accepts. Automaton has 54897 states and 89749 transitions. Word has length 118 [2019-09-10 06:12:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:16,214 INFO L475 AbstractCegarLoop]: Abstraction has 54897 states and 89749 transitions. [2019-09-10 06:12:16,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54897 states and 89749 transitions. [2019-09-10 06:12:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:12:16,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:16,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:16,216 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1992199255, now seen corresponding path program 1 times [2019-09-10 06:12:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:16,597 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:12:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:12:16,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:16,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:12:16,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:12:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:12:16,599 INFO L87 Difference]: Start difference. First operand 54897 states and 89749 transitions. Second operand 7 states. [2019-09-10 06:12:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:17,684 INFO L93 Difference]: Finished difference Result 212240 states and 346479 transitions. [2019-09-10 06:12:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:12:17,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-10 06:12:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:18,137 INFO L225 Difference]: With dead ends: 212240 [2019-09-10 06:12:18,138 INFO L226 Difference]: Without dead ends: 212240 [2019-09-10 06:12:18,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:12:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212240 states. [2019-09-10 06:12:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212240 to 148480. [2019-09-10 06:12:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148480 states. [2019-09-10 06:12:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148480 states to 148480 states and 241042 transitions. [2019-09-10 06:12:22,359 INFO L78 Accepts]: Start accepts. Automaton has 148480 states and 241042 transitions. Word has length 119 [2019-09-10 06:12:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:22,359 INFO L475 AbstractCegarLoop]: Abstraction has 148480 states and 241042 transitions. [2019-09-10 06:12:22,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:12:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 148480 states and 241042 transitions. [2019-09-10 06:12:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:12:22,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:22,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,362 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1753406439, now seen corresponding path program 1 times [2019-09-10 06:12:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:22,688 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:12:22,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:22,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:22,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:22,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:22,690 INFO L87 Difference]: Start difference. First operand 148480 states and 241042 transitions. Second operand 6 states. [2019-09-10 06:12:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:25,518 INFO L93 Difference]: Finished difference Result 205410 states and 333941 transitions. [2019-09-10 06:12:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:12:25,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-10 06:12:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:25,952 INFO L225 Difference]: With dead ends: 205410 [2019-09-10 06:12:25,952 INFO L226 Difference]: Without dead ends: 205410 [2019-09-10 06:12:25,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:12:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205410 states. [2019-09-10 06:12:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205410 to 148480. [2019-09-10 06:12:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148480 states. [2019-09-10 06:12:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148480 states to 148480 states and 240417 transitions. [2019-09-10 06:12:31,707 INFO L78 Accepts]: Start accepts. Automaton has 148480 states and 240417 transitions. Word has length 121 [2019-09-10 06:12:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:31,707 INFO L475 AbstractCegarLoop]: Abstraction has 148480 states and 240417 transitions. [2019-09-10 06:12:31,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 148480 states and 240417 transitions. [2019-09-10 06:12:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:12:31,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:31,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:31,709 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1710390244, now seen corresponding path program 1 times [2019-09-10 06:12:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:31,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:31,940 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:12:31,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:31,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:31,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:31,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:31,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:31,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:31,942 INFO L87 Difference]: Start difference. First operand 148480 states and 240417 transitions. Second operand 6 states. [2019-09-10 06:12:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:32,725 INFO L93 Difference]: Finished difference Result 287789 states and 465945 transitions. [2019-09-10 06:12:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:12:32,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-10 06:12:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:33,126 INFO L225 Difference]: With dead ends: 287789 [2019-09-10 06:12:33,126 INFO L226 Difference]: Without dead ends: 287789 [2019-09-10 06:12:33,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:12:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287789 states. [2019-09-10 06:12:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287789 to 287785. [2019-09-10 06:12:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287785 states. [2019-09-10 06:12:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287785 states to 287785 states and 465943 transitions. [2019-09-10 06:12:39,141 INFO L78 Accepts]: Start accepts. Automaton has 287785 states and 465943 transitions. Word has length 124 [2019-09-10 06:12:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:39,141 INFO L475 AbstractCegarLoop]: Abstraction has 287785 states and 465943 transitions. [2019-09-10 06:12:39,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 287785 states and 465943 transitions. [2019-09-10 06:12:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 06:12:39,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:39,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:39,143 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1484399164, now seen corresponding path program 1 times [2019-09-10 06:12:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:39,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:39,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:39,279 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:12:39,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:39,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:39,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:39,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:39,283 INFO L87 Difference]: Start difference. First operand 287785 states and 465943 transitions. Second operand 5 states. [2019-09-10 06:12:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:44,847 INFO L93 Difference]: Finished difference Result 473691 states and 760792 transitions. [2019-09-10 06:12:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:12:44,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 06:12:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:45,653 INFO L225 Difference]: With dead ends: 473691 [2019-09-10 06:12:45,654 INFO L226 Difference]: Without dead ends: 473691 [2019-09-10 06:12:45,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473691 states. [2019-09-10 06:12:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473691 to 292385. [2019-09-10 06:12:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292385 states. [2019-09-10 06:12:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292385 states to 292385 states and 470498 transitions. [2019-09-10 06:12:57,587 INFO L78 Accepts]: Start accepts. Automaton has 292385 states and 470498 transitions. Word has length 125 [2019-09-10 06:12:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:57,587 INFO L475 AbstractCegarLoop]: Abstraction has 292385 states and 470498 transitions. [2019-09-10 06:12:57,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 292385 states and 470498 transitions. [2019-09-10 06:12:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:12:57,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:57,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:57,596 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:57,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 508061634, now seen corresponding path program 1 times [2019-09-10 06:12:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 06:12:57,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:57,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:57,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:57,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:57,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:57,776 INFO L87 Difference]: Start difference. First operand 292385 states and 470498 transitions. Second operand 6 states. [2019-09-10 06:12:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:58,976 INFO L93 Difference]: Finished difference Result 394618 states and 636476 transitions. [2019-09-10 06:12:58,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:12:58,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 06:12:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:59,582 INFO L225 Difference]: With dead ends: 394618 [2019-09-10 06:12:59,582 INFO L226 Difference]: Without dead ends: 394618 [2019-09-10 06:12:59,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394618 states. [2019-09-10 06:13:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394618 to 348013. [2019-09-10 06:13:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348013 states. [2019-09-10 06:13:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348013 states to 348013 states and 560075 transitions. [2019-09-10 06:13:14,256 INFO L78 Accepts]: Start accepts. Automaton has 348013 states and 560075 transitions. Word has length 155 [2019-09-10 06:13:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:14,256 INFO L475 AbstractCegarLoop]: Abstraction has 348013 states and 560075 transitions. [2019-09-10 06:13:14,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:13:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 348013 states and 560075 transitions. [2019-09-10 06:13:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:13:14,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:14,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:14,267 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -511865934, now seen corresponding path program 1 times [2019-09-10 06:13:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:14,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 06:13:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:14,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:14,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:14,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:14,598 INFO L87 Difference]: Start difference. First operand 348013 states and 560075 transitions. Second operand 4 states. [2019-09-10 06:13:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:17,311 INFO L93 Difference]: Finished difference Result 567936 states and 916010 transitions. [2019-09-10 06:13:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:17,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-10 06:13:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:18,137 INFO L225 Difference]: With dead ends: 567936 [2019-09-10 06:13:18,137 INFO L226 Difference]: Without dead ends: 567936 [2019-09-10 06:13:18,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:13:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567936 states. [2019-09-10 06:13:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567936 to 500988. [2019-09-10 06:13:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500988 states. [2019-09-10 06:13:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500988 states to 500988 states and 808340 transitions. [2019-09-10 06:13:31,569 INFO L78 Accepts]: Start accepts. Automaton has 500988 states and 808340 transitions. Word has length 155 [2019-09-10 06:13:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:31,570 INFO L475 AbstractCegarLoop]: Abstraction has 500988 states and 808340 transitions. [2019-09-10 06:13:31,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 500988 states and 808340 transitions. [2019-09-10 06:13:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:13:31,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:31,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:31,576 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1925692450, now seen corresponding path program 1 times [2019-09-10 06:13:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:31,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:13:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:31,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:31,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:31,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:31,877 INFO L87 Difference]: Start difference. First operand 500988 states and 808340 transitions. Second operand 4 states. [2019-09-10 06:13:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:40,096 INFO L93 Difference]: Finished difference Result 804041 states and 1300367 transitions. [2019-09-10 06:13:40,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:40,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-10 06:13:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:41,524 INFO L225 Difference]: With dead ends: 804041 [2019-09-10 06:13:41,525 INFO L226 Difference]: Without dead ends: 804041 [2019-09-10 06:13:41,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:13:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804041 states. [2019-09-10 06:13:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804041 to 711055. [2019-09-10 06:13:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711055 states. [2019-09-10 06:14:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711055 states to 711055 states and 1150235 transitions. [2019-09-10 06:14:09,049 INFO L78 Accepts]: Start accepts. Automaton has 711055 states and 1150235 transitions. Word has length 155 [2019-09-10 06:14:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:09,050 INFO L475 AbstractCegarLoop]: Abstraction has 711055 states and 1150235 transitions. [2019-09-10 06:14:09,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 711055 states and 1150235 transitions. [2019-09-10 06:14:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:14:09,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:09,054 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:09,054 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash -711378670, now seen corresponding path program 1 times [2019-09-10 06:14:09,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:09,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:09,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:09,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:09,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:09,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:14:09,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 06:14:09,248 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [217], [220], [244], [247], [249], [350], [353], [356], [359], [362], [365], [372], [380], [382], [385], [386], [388], [397], [400], [411], [414], [426], [444], [447], [484], [492], [500], [508], [528], [531], [568], [576], [584], [592], [612], [615], [652], [660], [668], [676], [686], [690], [694], [696], [699], [736], [744], [752], [760], [1373], [1374], [1378], [1379], [1380] [2019-09-10 06:14:09,307 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:14:09,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:14:09,478 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:14:09,843 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:14:09,846 INFO L272 AbstractInterpreter]: Visited 131 different actions 362 times. Merged at 43 different actions 216 times. Widened at 23 different actions 24 times. Performed 1388 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1388 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 281 variables. [2019-09-10 06:14:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:09,851 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:14:10,397 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 88.55% of their original sizes. [2019-09-10 06:14:10,397 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:14:38,103 INFO L420 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2019-09-10 06:14:38,104 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:14:38,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:14:38,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [98] imperfect sequences [5] total 101 [2019-09-10 06:14:38,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:38,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-10 06:14:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-10 06:14:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=7785, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 06:14:38,109 INFO L87 Difference]: Start difference. First operand 711055 states and 1150235 transitions. Second operand 98 states. [2019-09-10 06:20:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:49,673 INFO L93 Difference]: Finished difference Result 2891901 states and 4596727 transitions. [2019-09-10 06:20:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 391 states. [2019-09-10 06:20:49,673 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 155 [2019-09-10 06:20:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:57,695 INFO L225 Difference]: With dead ends: 2891901 [2019-09-10 06:20:57,695 INFO L226 Difference]: Without dead ends: 2891901 [2019-09-10 06:20:57,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71860 ImplicationChecksByTransitivity, 91.8s TimeCoverageRelationStatistics Valid=26620, Invalid=153580, Unknown=0, NotChecked=0, Total=180200 [2019-09-10 06:20:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891901 states. [2019-09-10 06:22:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891901 to 1100342. [2019-09-10 06:22:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100342 states. [2019-09-10 06:22:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100342 states to 1100342 states and 1778135 transitions. [2019-09-10 06:22:06,581 INFO L78 Accepts]: Start accepts. Automaton has 1100342 states and 1778135 transitions. Word has length 155 [2019-09-10 06:22:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:06,582 INFO L475 AbstractCegarLoop]: Abstraction has 1100342 states and 1778135 transitions. [2019-09-10 06:22:06,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-10 06:22:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1100342 states and 1778135 transitions. [2019-09-10 06:22:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:22:06,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:06,594 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,594 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1574420487, now seen corresponding path program 1 times [2019-09-10 06:22:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:06,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:06,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:06,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:06,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:06,729 INFO L87 Difference]: Start difference. First operand 1100342 states and 1778135 transitions. Second operand 3 states. [2019-09-10 06:22:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:26,779 INFO L93 Difference]: Finished difference Result 2135484 states and 3438377 transitions. [2019-09-10 06:22:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:26,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 06:22:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:32,622 INFO L225 Difference]: With dead ends: 2135484 [2019-09-10 06:22:32,622 INFO L226 Difference]: Without dead ends: 2135484 [2019-09-10 06:22:32,623 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:22:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135484 states.