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.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:25:50,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:25:50,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:25:50,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:25:50,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:25:50,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:25:50,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:25:50,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:25:50,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:25:50,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:25:50,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:25:50,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:25:50,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:25:50,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:25:50,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:25:50,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:25:50,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:25:50,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:25:50,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:25:50,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:25:50,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:25:50,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:25:50,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:25:50,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:25:50,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:25:50,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:25:50,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:25:50,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:25:50,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:25:50,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:25:50,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:25:50,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:25:50,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:25:50,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:25:50,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:25:50,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:25:50,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:25:50,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:25:50,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:25:50,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:25:50,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:25:50,665 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:25:50,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:25:50,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:25:50,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:25:50,681 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:25:50,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:25:50,682 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:25:50,683 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:25:50,683 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:25:50,683 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:25:50,683 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:25:50,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:25:50,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:25:50,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:25:50,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:25:50,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:25:50,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:25:50,686 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:25:50,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:25:50,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:25:50,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:25:50,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:25:50,687 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:25:50,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:25:50,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:25:50,687 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:25:50,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:25:50,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:25:50,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:25:50,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:25:50,742 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:25:50,743 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.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:25:50,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325e046f8/0f5eb44a233b4390b3f952686d7a8139/FLAG202843b8b [2019-09-10 06:25:51,355 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:25:51,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:25:51,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325e046f8/0f5eb44a233b4390b3f952686d7a8139/FLAG202843b8b [2019-09-10 06:25:51,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325e046f8/0f5eb44a233b4390b3f952686d7a8139 [2019-09-10 06:25:51,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:25:51,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:25:51,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:25:51,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:25:51,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:25:51,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:25:51" (1/1) ... [2019-09-10 06:25:51,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f21a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:51, skipping insertion in model container [2019-09-10 06:25:51,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:25:51" (1/1) ... [2019-09-10 06:25:51,651 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:25:51,742 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:25:52,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:25:52,314 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:25:52,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:25:52,497 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:25:52,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52 WrapperNode [2019-09-10 06:25:52,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:25:52,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:25:52,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:25:52,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:25:52,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (1/1) ... [2019-09-10 06:25:52,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:25:52,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:25:52,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:25:52,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:25:52,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (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:25:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:25:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:25:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:25:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:25:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:25:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:25:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:25:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:25:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:25:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:25:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:25:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:25:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:25:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:25:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:25:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:25:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:25:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:25:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:25:54,287 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:25:54,288 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:25:54,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:25:54 BoogieIcfgContainer [2019-09-10 06:25:54,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:25:54,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:25:54,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:25:54,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:25:54,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:25:51" (1/3) ... [2019-09-10 06:25:54,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf245da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:25:54, skipping insertion in model container [2019-09-10 06:25:54,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:52" (2/3) ... [2019-09-10 06:25:54,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf245da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:25:54, skipping insertion in model container [2019-09-10 06:25:54,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:25:54" (3/3) ... [2019-09-10 06:25:54,298 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:25:54,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:25:54,316 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:25:54,333 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:25:54,358 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:25:54,358 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:25:54,358 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:25:54,358 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:25:54,359 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:25:54,359 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:25:54,359 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:25:54,359 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:25:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-10 06:25:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:25:54,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:54,407 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:25:54,409 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-10 06:25:54,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:54,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:54,994 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:25:54,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:54,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:54,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:55,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:55,020 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-10 06:25:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:55,164 INFO L93 Difference]: Finished difference Result 444 states and 770 transitions. [2019-09-10 06:25:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:55,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:25:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:55,198 INFO L225 Difference]: With dead ends: 444 [2019-09-10 06:25:55,198 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 06:25:55,202 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:25:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 06:25:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-10 06:25:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 06:25:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-10 06:25:55,279 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-10 06:25:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:55,280 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-10 06:25:55,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-10 06:25:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:25:55,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:55,288 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:25:55,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-10 06:25:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:55,595 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:25:55,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:55,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:55,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:55,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:55,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:55,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:55,600 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-10 06:25:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:55,668 INFO L93 Difference]: Finished difference Result 537 states and 891 transitions. [2019-09-10 06:25:55,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:55,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:25:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:55,677 INFO L225 Difference]: With dead ends: 537 [2019-09-10 06:25:55,677 INFO L226 Difference]: Without dead ends: 537 [2019-09-10 06:25:55,679 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:25:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-10 06:25:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-10 06:25:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-10 06:25:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-10 06:25:55,720 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-10 06:25:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:55,721 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-10 06:25:55,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-10 06:25:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:25:55,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:55,726 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:25:55,727 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-10 06:25:55,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:55,848 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:25:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:55,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:55,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:55,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:55,850 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-10 06:25:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:55,882 INFO L93 Difference]: Finished difference Result 848 states and 1411 transitions. [2019-09-10 06:25:55,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:55,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:25:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:55,888 INFO L225 Difference]: With dead ends: 848 [2019-09-10 06:25:55,888 INFO L226 Difference]: Without dead ends: 848 [2019-09-10 06:25:55,889 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:25:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-10 06:25:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-10 06:25:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-10 06:25:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-10 06:25:55,914 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-10 06:25:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:55,915 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-10 06:25:55,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-10 06:25:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:25:55,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:55,919 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:25:55,920 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-10 06:25:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:55,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:56,057 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:25:56,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:56,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:56,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:56,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:56,061 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-10 06:25:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:56,101 INFO L93 Difference]: Finished difference Result 1126 states and 1877 transitions. [2019-09-10 06:25:56,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:56,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:25:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:56,110 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 06:25:56,111 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 06:25:56,111 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:25:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 06:25:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-10 06:25:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-10 06:25:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-10 06:25:56,198 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-10 06:25:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:56,199 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-10 06:25:56,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-10 06:25:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:25:56,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:56,201 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:25:56,201 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-10 06:25:56,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:56,353 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:25:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:56,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:56,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:56,357 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-10 06:25:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:56,409 INFO L93 Difference]: Finished difference Result 1954 states and 3248 transitions. [2019-09-10 06:25:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:56,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:25:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:56,429 INFO L225 Difference]: With dead ends: 1954 [2019-09-10 06:25:56,429 INFO L226 Difference]: Without dead ends: 1954 [2019-09-10 06:25:56,430 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:25:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-10 06:25:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-10 06:25:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 06:25:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-10 06:25:56,507 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-10 06:25:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:56,508 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-10 06:25:56,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-10 06:25:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:25:56,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:56,511 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:25:56,513 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-10 06:25:56,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:56,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:56,664 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:25:56,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:56,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:56,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:56,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:56,666 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-10 06:25:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:56,708 INFO L93 Difference]: Finished difference Result 2647 states and 4403 transitions. [2019-09-10 06:25:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:56,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:25:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:56,725 INFO L225 Difference]: With dead ends: 2647 [2019-09-10 06:25:56,725 INFO L226 Difference]: Without dead ends: 2647 [2019-09-10 06:25:56,726 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:25:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-10 06:25:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-10 06:25:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-10 06:25:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-10 06:25:56,832 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-10 06:25:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:56,832 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-10 06:25:56,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-10 06:25:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:25:56,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:56,834 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:25:56,835 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-10 06:25:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:56,943 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:25:56,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:56,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:56,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:56,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:56,945 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-10 06:25:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:57,000 INFO L93 Difference]: Finished difference Result 4816 states and 7949 transitions. [2019-09-10 06:25:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:57,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:25:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:57,026 INFO L225 Difference]: With dead ends: 4816 [2019-09-10 06:25:57,026 INFO L226 Difference]: Without dead ends: 4816 [2019-09-10 06:25:57,026 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:25:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-10 06:25:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-10 06:25:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-10 06:25:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-10 06:25:57,143 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-10 06:25:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:57,143 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-10 06:25:57,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-10 06:25:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:25:57,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:57,146 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, 1, 1] [2019-09-10 06:25:57,146 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-10 06:25:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:57,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:57,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:57,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:57,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:57,418 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:25:57,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:57,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:25:57,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:57,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:25:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:25:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:25:57,420 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-10 06:25:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:57,965 INFO L93 Difference]: Finished difference Result 24302 states and 40369 transitions. [2019-09-10 06:25:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:25:57,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 06:25:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:58,063 INFO L225 Difference]: With dead ends: 24302 [2019-09-10 06:25:58,064 INFO L226 Difference]: Without dead ends: 24302 [2019-09-10 06:25:58,064 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:25:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-10 06:25:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-10 06:25:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-10 06:25:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-10 06:25:58,444 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-10 06:25:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:58,445 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-10 06:25:58,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:25:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-10 06:25:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:25:58,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:58,447 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, 1, 1, 1] [2019-09-10 06:25:58,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-10 06:25:58,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:58,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:58,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:58,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:58,651 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:25:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:58,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:58,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:58,653 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-10 06:25:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:58,821 INFO L93 Difference]: Finished difference Result 18232 states and 30131 transitions. [2019-09-10 06:25:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:58,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:25:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:58,862 INFO L225 Difference]: With dead ends: 18232 [2019-09-10 06:25:58,863 INFO L226 Difference]: Without dead ends: 18232 [2019-09-10 06:25:58,864 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:25:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-10 06:25:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-10 06:25:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-10 06:25:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-10 06:25:59,134 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-10 06:25:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:59,135 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-10 06:25:59,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-10 06:25:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:25:59,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:59,137 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, 1, 1, 1] [2019-09-10 06:25:59,137 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-10 06:25:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:59,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:59,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:59,256 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:25:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:59,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:59,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:59,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:59,260 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-10 06:25:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:59,450 INFO L93 Difference]: Finished difference Result 20841 states and 34254 transitions. [2019-09-10 06:25:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:59,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 06:25:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:59,503 INFO L225 Difference]: With dead ends: 20841 [2019-09-10 06:25:59,504 INFO L226 Difference]: Without dead ends: 20841 [2019-09-10 06:25:59,504 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:25:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-10 06:25:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-10 06:25:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-10 06:25:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-10 06:25:59,782 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-10 06:25:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:59,782 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-10 06:25:59,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-10 06:25:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:25:59,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:59,784 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, 1, 1, 1, 1] [2019-09-10 06:25:59,785 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-10 06:25:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:59,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:59,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:59,912 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:25:59,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:59,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:59,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:59,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:59,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:59,914 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-10 06:26:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:00,197 INFO L93 Difference]: Finished difference Result 40351 states and 66359 transitions. [2019-09-10 06:26:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:00,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:26:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:00,294 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 06:26:00,294 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 06:26:00,294 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:26:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 06:26:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-10 06:26:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-10 06:26:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-10 06:26:00,824 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-10 06:26:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:00,825 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-10 06:26:00,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-10 06:26:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:26:00,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:00,827 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, 1, 1, 1, 1, 1] [2019-09-10 06:26:00,828 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-10 06:26:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:00,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:00,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:01,775 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:26:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:01,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:01,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:01,778 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-10 06:26:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:02,055 INFO L93 Difference]: Finished difference Result 64914 states and 106473 transitions. [2019-09-10 06:26:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:02,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:26:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:02,224 INFO L225 Difference]: With dead ends: 64914 [2019-09-10 06:26:02,224 INFO L226 Difference]: Without dead ends: 64914 [2019-09-10 06:26:02,225 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:26:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-10 06:26:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-10 06:26:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-10 06:26:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-10 06:26:03,348 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-10 06:26:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:03,349 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-10 06:26:03,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-10 06:26:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 06:26:03,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:03,351 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:03,351 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:03,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-10 06:26:03,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:03,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:03,545 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:26:03,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:03,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:26:03,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:03,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:26:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:26:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:26:03,547 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-10 06:26:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:05,109 INFO L93 Difference]: Finished difference Result 212252 states and 346491 transitions. [2019-09-10 06:26:05,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:26:05,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-10 06:26:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:05,489 INFO L225 Difference]: With dead ends: 212252 [2019-09-10 06:26:05,489 INFO L226 Difference]: Without dead ends: 212252 [2019-09-10 06:26:05,490 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:26:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-10 06:26:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-10 06:26:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:26:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-10 06:26:09,796 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-10 06:26:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:09,797 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-10 06:26:09,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:26:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-10 06:26:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 06:26:09,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:09,799 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:09,800 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-10 06:26:09,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:09,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:09,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:09,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:09,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:10,120 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:26:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:26:10,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:10,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:26:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:26:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:26:10,122 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-10 06:26:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:13,041 INFO L93 Difference]: Finished difference Result 205422 states and 333953 transitions. [2019-09-10 06:26:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:26:13,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 06:26:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:13,445 INFO L225 Difference]: With dead ends: 205422 [2019-09-10 06:26:13,445 INFO L226 Difference]: Without dead ends: 205422 [2019-09-10 06:26:13,445 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:26:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-10 06:26:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-10 06:26:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:26:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-10 06:26:18,311 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-10 06:26:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:18,311 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-10 06:26:18,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:26:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-10 06:26:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:26:18,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:18,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:18,313 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-10 06:26:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:18,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:18,634 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:26:18,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:18,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:26:18,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:18,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:26:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:26:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:26:18,637 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-10 06:26:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:19,473 INFO L93 Difference]: Finished difference Result 287801 states and 465957 transitions. [2019-09-10 06:26:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:26:19,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 06:26:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:19,896 INFO L225 Difference]: With dead ends: 287801 [2019-09-10 06:26:19,896 INFO L226 Difference]: Without dead ends: 287801 [2019-09-10 06:26:19,896 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:26:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-10 06:26:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-10 06:26:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-10 06:26:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-10 06:26:27,114 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-10 06:26:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:27,114 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-10 06:26:27,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:26:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-10 06:26:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:26:27,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:27,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:27,116 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-10 06:26:27,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:27,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:27,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:27,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:27,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:27,265 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:26:27,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:27,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:26:27,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:27,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:26:27,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:26:27,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:27,267 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-10 06:26:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:28,633 INFO L93 Difference]: Finished difference Result 473703 states and 760804 transitions. [2019-09-10 06:26:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:26:28,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 06:26:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:35,303 INFO L225 Difference]: With dead ends: 473703 [2019-09-10 06:26:35,304 INFO L226 Difference]: Without dead ends: 473703 [2019-09-10 06:26:35,304 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:26:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-10 06:26:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-10 06:26:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-10 06:26:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-10 06:26:39,297 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-10 06:26:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:39,297 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-10 06:26:39,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:26:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-10 06:26:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:26:39,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:39,308 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,308 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-10 06:26:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:39,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:26:39,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:26:39,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 06:26:39,506 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], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [256], [280], [283], [285], [289], [318], [322], [351], [386], [389], [392], [395], [398], [401], [408], [416], [418], [421], [422], [424], [433], [436], [447], [450], [462], [480], [483], [520], [528], [536], [544], [550], [554], [558], [562], [564], [567], [604], [612], [620], [628], [634], [638], [642], [646], [648], [651], [688], [696], [704], [712], [722], [726], [730], [732], [735], [772], [780], [788], [796], [1421], [1422], [1426], [1427], [1428] [2019-09-10 06:26:39,571 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:26:39,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:26:39,812 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:26:40,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:26:40,354 INFO L272 AbstractInterpreter]: Visited 155 different actions 436 times. Merged at 55 different actions 257 times. Widened at 11 different actions 15 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 281 variables. [2019-09-10 06:26:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:40,358 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:26:41,893 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 87.58% of their original sizes. [2019-09-10 06:26:41,893 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:27:18,253 INFO L420 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2019-09-10 06:27:18,254 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:27:18,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:27:18,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [114] imperfect sequences [5] total 117 [2019-09-10 06:27:18,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:18,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-10 06:27:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-10 06:27:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1689, Invalid=11193, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 06:27:18,262 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 114 states. [2019-09-10 06:32:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:04,928 INFO L93 Difference]: Finished difference Result 1405457 states and 2209778 transitions. [2019-09-10 06:32:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-10 06:32:04,929 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 167 [2019-09-10 06:32:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:07,682 INFO L225 Difference]: With dead ends: 1405457 [2019-09-10 06:32:07,682 INFO L226 Difference]: Without dead ends: 1405457 [2019-09-10 06:32:07,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16201 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=5828, Invalid=41478, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 06:32:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405457 states. [2019-09-10 06:32:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405457 to 498976. [2019-09-10 06:32:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498976 states. [2019-09-10 06:32:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498976 states to 498976 states and 800298 transitions. [2019-09-10 06:32:44,427 INFO L78 Accepts]: Start accepts. Automaton has 498976 states and 800298 transitions. Word has length 167 [2019-09-10 06:32:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:44,428 INFO L475 AbstractCegarLoop]: Abstraction has 498976 states and 800298 transitions. [2019-09-10 06:32:44,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-10 06:32:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 498976 states and 800298 transitions. [2019-09-10 06:32:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:32:44,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:44,456 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,457 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-10 06:32:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:44,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:44,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:32:44,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:44,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:44,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:44,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:44,863 INFO L87 Difference]: Start difference. First operand 498976 states and 800298 transitions. Second operand 4 states. [2019-09-10 06:32:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:55,545 INFO L93 Difference]: Finished difference Result 791377 states and 1272215 transitions. [2019-09-10 06:32:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:32:55,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:32:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:56,877 INFO L225 Difference]: With dead ends: 791377 [2019-09-10 06:32:56,877 INFO L226 Difference]: Without dead ends: 791377 [2019-09-10 06:32:56,878 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:32:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791377 states. [2019-09-10 06:33:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791377 to 701977. [2019-09-10 06:33:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701977 states. [2019-09-10 06:33:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701977 states to 701977 states and 1129209 transitions. [2019-09-10 06:33:15,103 INFO L78 Accepts]: Start accepts. Automaton has 701977 states and 1129209 transitions. Word has length 167 [2019-09-10 06:33:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:15,104 INFO L475 AbstractCegarLoop]: Abstraction has 701977 states and 1129209 transitions. [2019-09-10 06:33:15,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 701977 states and 1129209 transitions. [2019-09-10 06:33:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:33:15,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:15,115 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:15,116 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-10 06:33:15,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:33:15,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:15,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:33:15,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:15,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:33:15,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:33:15,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:33:15,342 INFO L87 Difference]: Start difference. First operand 701977 states and 1129209 transitions. Second operand 6 states. [2019-09-10 06:33:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:26,998 INFO L93 Difference]: Finished difference Result 869972 states and 1402219 transitions. [2019-09-10 06:33:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:33:26,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:33:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:28,693 INFO L225 Difference]: With dead ends: 869972 [2019-09-10 06:33:28,693 INFO L226 Difference]: Without dead ends: 869972 [2019-09-10 06:33:28,694 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:33:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869972 states. [2019-09-10 06:33:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869972 to 788654. [2019-09-10 06:33:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788654 states. [2019-09-10 06:33:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788654 states to 788654 states and 1268977 transitions. [2019-09-10 06:33:56,689 INFO L78 Accepts]: Start accepts. Automaton has 788654 states and 1268977 transitions. Word has length 167 [2019-09-10 06:33:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:56,690 INFO L475 AbstractCegarLoop]: Abstraction has 788654 states and 1268977 transitions. [2019-09-10 06:33:56,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:33:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 788654 states and 1268977 transitions. [2019-09-10 06:33:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:33:56,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:56,699 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:56,700 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1361288056, now seen corresponding path program 1 times [2019-09-10 06:33:56,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:56,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:56,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:56,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:33:57,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:57,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:57,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:57,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:57,046 INFO L87 Difference]: Start difference. First operand 788654 states and 1268977 transitions. Second operand 4 states. [2019-09-10 06:34:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:12,004 INFO L93 Difference]: Finished difference Result 1268291 states and 2046126 transitions. [2019-09-10 06:34:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:34:12,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:34:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:14,384 INFO L225 Difference]: With dead ends: 1268291 [2019-09-10 06:34:14,384 INFO L226 Difference]: Without dead ends: 1268291 [2019-09-10 06:34:14,385 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:34:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268291 states. [2019-09-10 06:34:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268291 to 1123507. [2019-09-10 06:34:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123507 states. [2019-09-10 06:34:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123507 states to 1123507 states and 1813409 transitions. [2019-09-10 06:34:47,569 INFO L78 Accepts]: Start accepts. Automaton has 1123507 states and 1813409 transitions. Word has length 167 [2019-09-10 06:34:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:47,569 INFO L475 AbstractCegarLoop]: Abstraction has 1123507 states and 1813409 transitions. [2019-09-10 06:34:47,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1123507 states and 1813409 transitions. [2019-09-10 06:34:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:34:47,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:47,576 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,577 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash -224812315, now seen corresponding path program 1 times [2019-09-10 06:34:47,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:47,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:47,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:47,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:34:47,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:47,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:34:47,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:47,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:34:47,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:34:47,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:47,686 INFO L87 Difference]: Start difference. First operand 1123507 states and 1813409 transitions. Second operand 3 states. [2019-09-10 06:35:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:06,082 INFO L93 Difference]: Finished difference Result 2163983 states and 3478167 transitions. [2019-09-10 06:35:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:06,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:35:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:23,130 INFO L225 Difference]: With dead ends: 2163983 [2019-09-10 06:35:23,130 INFO L226 Difference]: Without dead ends: 2163983 [2019-09-10 06:35:23,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163983 states.