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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:45:23,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:45:23,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:45:23,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:45:23,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:45:23,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:45:23,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:45:23,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:45:23,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:45:23,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:45:23,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:45:23,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:45:23,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:45:23,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:45:23,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:45:23,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:45:23,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:45:23,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:45:23,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:45:23,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:45:23,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:45:23,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:45:23,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:45:23,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:45:23,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:45:23,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:45:23,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:45:23,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:45:23,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:45:23,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:45:23,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:45:23,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:45:23,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:45:23,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:45:23,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:45:23,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:45:23,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:45:23,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:45:23,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:45:23,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:45:23,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:45:23,625 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 08:45:23,639 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:45:23,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:45:23,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:45:23,640 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:45:23,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:45:23,641 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:45:23,641 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:45:23,641 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:45:23,642 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:45:23,642 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:45:23,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:45:23,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:45:23,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:45:23,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:45:23,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:45:23,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:45:23,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:45:23,644 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:45:23,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:45:23,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:45:23,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:45:23,645 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:45:23,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:45:23,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:45:23,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:45:23,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:45:23,646 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:45:23,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:45:23,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:45:23,646 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:45:23,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:45:23,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:45:23,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:45:23,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:45:23,708 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:45:23,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:45:23,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94da8f79a/8d781dd2902e490891566501a31861c3/FLAG90cdb082a [2019-09-10 08:45:24,325 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:45:24,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:45:24,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94da8f79a/8d781dd2902e490891566501a31861c3/FLAG90cdb082a [2019-09-10 08:45:24,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94da8f79a/8d781dd2902e490891566501a31861c3 [2019-09-10 08:45:24,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:45:24,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:45:24,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:24,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:45:24,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:45:24,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:24" (1/1) ... [2019-09-10 08:45:24,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa66722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:24, skipping insertion in model container [2019-09-10 08:45:24,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:24" (1/1) ... [2019-09-10 08:45:24,577 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:45:24,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:45:25,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:25,407 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:45:25,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:25,645 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:45:25,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25 WrapperNode [2019-09-10 08:45:25,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:25,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:45:25,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:45:25,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:45:25,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (1/1) ... [2019-09-10 08:45:25,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:45:25,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:45:25,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:45:25,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:45:25,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (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 08:45:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:45:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:45:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:45:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:45:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:45:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:45:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:45:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:45:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:45:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:45:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:45:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:45:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:45:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:45:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:45:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:45:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:45:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:45:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:45:27,536 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:45:27,537 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:45:27,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:27 BoogieIcfgContainer [2019-09-10 08:45:27,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:45:27,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:45:27,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:45:27,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:45:27,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:45:24" (1/3) ... [2019-09-10 08:45:27,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:27, skipping insertion in model container [2019-09-10 08:45:27,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:25" (2/3) ... [2019-09-10 08:45:27,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:27, skipping insertion in model container [2019-09-10 08:45:27,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:27" (3/3) ... [2019-09-10 08:45:27,548 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:45:27,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:45:27,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-10 08:45:27,585 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-10 08:45:27,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:45:27,616 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:45:27,616 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:45:27,616 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:45:27,617 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:45:27,617 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:45:27,617 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:45:27,617 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:45:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-09-10 08:45:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:45:27,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:27,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:27,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1499466548, now seen corresponding path program 1 times [2019-09-10 08:45:27,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:27,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:28,497 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 08:45:28,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:28,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:28,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:28,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:28,527 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 3 states. [2019-09-10 08:45:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:28,727 INFO L93 Difference]: Finished difference Result 624 states and 1086 transitions. [2019-09-10 08:45:28,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:28,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 08:45:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:28,751 INFO L225 Difference]: With dead ends: 624 [2019-09-10 08:45:28,752 INFO L226 Difference]: Without dead ends: 616 [2019-09-10 08:45:28,754 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 08:45:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-10 08:45:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-09-10 08:45:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 08:45:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 899 transitions. [2019-09-10 08:45:28,872 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 899 transitions. Word has length 154 [2019-09-10 08:45:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:28,875 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 899 transitions. [2019-09-10 08:45:28,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 899 transitions. [2019-09-10 08:45:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:45:28,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:28,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:28,893 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1852158380, now seen corresponding path program 1 times [2019-09-10 08:45:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:28,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:29,174 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 08:45:29,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:29,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:29,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:29,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:29,178 INFO L87 Difference]: Start difference. First operand 614 states and 899 transitions. Second operand 3 states. [2019-09-10 08:45:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:29,313 INFO L93 Difference]: Finished difference Result 1016 states and 1512 transitions. [2019-09-10 08:45:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:29,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 08:45:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:29,320 INFO L225 Difference]: With dead ends: 1016 [2019-09-10 08:45:29,320 INFO L226 Difference]: Without dead ends: 1016 [2019-09-10 08:45:29,321 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 08:45:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-10 08:45:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1014. [2019-09-10 08:45:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-10 08:45:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1511 transitions. [2019-09-10 08:45:29,346 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1511 transitions. Word has length 154 [2019-09-10 08:45:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:29,347 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1511 transitions. [2019-09-10 08:45:29,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1511 transitions. [2019-09-10 08:45:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:45:29,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:29,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, 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 08:45:29,352 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1852497004, now seen corresponding path program 1 times [2019-09-10 08:45:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:29,689 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 08:45:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:29,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:29,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:29,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:29,691 INFO L87 Difference]: Start difference. First operand 1014 states and 1511 transitions. Second operand 4 states. [2019-09-10 08:45:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:29,811 INFO L93 Difference]: Finished difference Result 1963 states and 2895 transitions. [2019-09-10 08:45:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:29,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 08:45:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:29,830 INFO L225 Difference]: With dead ends: 1963 [2019-09-10 08:45:29,830 INFO L226 Difference]: Without dead ends: 1963 [2019-09-10 08:45:29,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:45:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-10 08:45:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1921. [2019-09-10 08:45:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-09-10 08:45:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2849 transitions. [2019-09-10 08:45:29,908 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2849 transitions. Word has length 154 [2019-09-10 08:45:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:29,909 INFO L475 AbstractCegarLoop]: Abstraction has 1921 states and 2849 transitions. [2019-09-10 08:45:29,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2849 transitions. [2019-09-10 08:45:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:45:29,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:29,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:29,914 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1278337866, now seen corresponding path program 1 times [2019-09-10 08:45:29,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:29,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:29,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:29,992 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 08:45:29,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:29,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:29,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:29,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:29,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:29,994 INFO L87 Difference]: Start difference. First operand 1921 states and 2849 transitions. Second operand 3 states. [2019-09-10 08:45:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:30,036 INFO L93 Difference]: Finished difference Result 3828 states and 5677 transitions. [2019-09-10 08:45:30,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:30,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:45:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:30,055 INFO L225 Difference]: With dead ends: 3828 [2019-09-10 08:45:30,055 INFO L226 Difference]: Without dead ends: 3828 [2019-09-10 08:45:30,055 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 08:45:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2019-09-10 08:45:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 1923. [2019-09-10 08:45:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-09-10 08:45:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2851 transitions. [2019-09-10 08:45:30,122 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2851 transitions. Word has length 155 [2019-09-10 08:45:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:30,122 INFO L475 AbstractCegarLoop]: Abstraction has 1923 states and 2851 transitions. [2019-09-10 08:45:30,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2851 transitions. [2019-09-10 08:45:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:45:30,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:30,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:30,128 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1949044653, now seen corresponding path program 1 times [2019-09-10 08:45:30,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:30,254 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 08:45:30,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:30,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:30,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:30,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:30,257 INFO L87 Difference]: Start difference. First operand 1923 states and 2851 transitions. Second operand 3 states. [2019-09-10 08:45:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:30,337 INFO L93 Difference]: Finished difference Result 3722 states and 5462 transitions. [2019-09-10 08:45:30,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:30,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 08:45:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:30,355 INFO L225 Difference]: With dead ends: 3722 [2019-09-10 08:45:30,356 INFO L226 Difference]: Without dead ends: 3722 [2019-09-10 08:45:30,356 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 08:45:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-10 08:45:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3680. [2019-09-10 08:45:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-09-10 08:45:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5416 transitions. [2019-09-10 08:45:30,493 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5416 transitions. Word has length 156 [2019-09-10 08:45:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:30,493 INFO L475 AbstractCegarLoop]: Abstraction has 3680 states and 5416 transitions. [2019-09-10 08:45:30,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5416 transitions. [2019-09-10 08:45:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:45:30,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:30,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:30,501 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1948951408, now seen corresponding path program 1 times [2019-09-10 08:45:30,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:30,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:30,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:30,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:30,705 INFO L87 Difference]: Start difference. First operand 3680 states and 5416 transitions. Second operand 4 states. [2019-09-10 08:45:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:30,756 INFO L93 Difference]: Finished difference Result 2886 states and 4231 transitions. [2019-09-10 08:45:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:30,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-10 08:45:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:30,770 INFO L225 Difference]: With dead ends: 2886 [2019-09-10 08:45:30,770 INFO L226 Difference]: Without dead ends: 2826 [2019-09-10 08:45:30,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-09-10 08:45:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2826. [2019-09-10 08:45:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-09-10 08:45:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4145 transitions. [2019-09-10 08:45:30,852 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4145 transitions. Word has length 156 [2019-09-10 08:45:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:30,852 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 4145 transitions. [2019-09-10 08:45:30,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4145 transitions. [2019-09-10 08:45:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:45:30,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:30,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:30,867 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1917490942, now seen corresponding path program 1 times [2019-09-10 08:45:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:30,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:30,961 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 08:45:30,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:30,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:30,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:30,964 INFO L87 Difference]: Start difference. First operand 2826 states and 4145 transitions. Second operand 3 states. [2019-09-10 08:45:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:31,045 INFO L93 Difference]: Finished difference Result 4364 states and 6519 transitions. [2019-09-10 08:45:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:31,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:45:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:31,071 INFO L225 Difference]: With dead ends: 4364 [2019-09-10 08:45:31,072 INFO L226 Difference]: Without dead ends: 4364 [2019-09-10 08:45:31,072 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 08:45:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2019-09-10 08:45:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3710. [2019-09-10 08:45:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-09-10 08:45:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5586 transitions. [2019-09-10 08:45:31,231 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5586 transitions. Word has length 158 [2019-09-10 08:45:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:31,232 INFO L475 AbstractCegarLoop]: Abstraction has 3710 states and 5586 transitions. [2019-09-10 08:45:31,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5586 transitions. [2019-09-10 08:45:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:45:31,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:31,238 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, 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 08:45:31,238 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash -473203751, now seen corresponding path program 1 times [2019-09-10 08:45:31,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:31,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:31,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:31,334 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 08:45:31,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:31,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:31,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:31,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:31,336 INFO L87 Difference]: Start difference. First operand 3710 states and 5586 transitions. Second operand 3 states. [2019-09-10 08:45:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:31,423 INFO L93 Difference]: Finished difference Result 5924 states and 9058 transitions. [2019-09-10 08:45:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:31,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:45:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:31,477 INFO L225 Difference]: With dead ends: 5924 [2019-09-10 08:45:31,478 INFO L226 Difference]: Without dead ends: 5924 [2019-09-10 08:45:31,478 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 08:45:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5924 states. [2019-09-10 08:45:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5924 to 5266. [2019-09-10 08:45:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5266 states. [2019-09-10 08:45:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 8111 transitions. [2019-09-10 08:45:31,686 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 8111 transitions. Word has length 160 [2019-09-10 08:45:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:31,687 INFO L475 AbstractCegarLoop]: Abstraction has 5266 states and 8111 transitions. [2019-09-10 08:45:31,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 8111 transitions. [2019-09-10 08:45:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:31,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:31,694 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, 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 08:45:31,694 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 68772030, now seen corresponding path program 1 times [2019-09-10 08:45:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:31,875 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 08:45:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:31,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:45:31,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:31,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:45:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:45:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:31,877 INFO L87 Difference]: Start difference. First operand 5266 states and 8111 transitions. Second operand 5 states. [2019-09-10 08:45:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:32,239 INFO L93 Difference]: Finished difference Result 5266 states and 8046 transitions. [2019-09-10 08:45:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:32,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-10 08:45:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:32,266 INFO L225 Difference]: With dead ends: 5266 [2019-09-10 08:45:32,266 INFO L226 Difference]: Without dead ends: 5266 [2019-09-10 08:45:32,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:45:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-09-10 08:45:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5266. [2019-09-10 08:45:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5266 states. [2019-09-10 08:45:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 8046 transitions. [2019-09-10 08:45:32,394 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 8046 transitions. Word has length 161 [2019-09-10 08:45:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:32,394 INFO L475 AbstractCegarLoop]: Abstraction has 5266 states and 8046 transitions. [2019-09-10 08:45:32,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:45:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 8046 transitions. [2019-09-10 08:45:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:32,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:32,400 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, 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 08:45:32,401 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -901806941, now seen corresponding path program 1 times [2019-09-10 08:45:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:32,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:32,644 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 08:45:32,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:32,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:45:32,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:32,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:45:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:45:32,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:32,646 INFO L87 Difference]: Start difference. First operand 5266 states and 8046 transitions. Second operand 9 states. [2019-09-10 08:45:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:34,002 INFO L93 Difference]: Finished difference Result 21917 states and 33385 transitions. [2019-09-10 08:45:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:45:34,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-09-10 08:45:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:34,062 INFO L225 Difference]: With dead ends: 21917 [2019-09-10 08:45:34,062 INFO L226 Difference]: Without dead ends: 21917 [2019-09-10 08:45:34,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:45:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21917 states. [2019-09-10 08:45:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21917 to 14238. [2019-09-10 08:45:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14238 states. [2019-09-10 08:45:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14238 states to 14238 states and 21636 transitions. [2019-09-10 08:45:34,582 INFO L78 Accepts]: Start accepts. Automaton has 14238 states and 21636 transitions. Word has length 161 [2019-09-10 08:45:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:34,583 INFO L475 AbstractCegarLoop]: Abstraction has 14238 states and 21636 transitions. [2019-09-10 08:45:34,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:45:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14238 states and 21636 transitions. [2019-09-10 08:45:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:34,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:34,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:34,595 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash -590735011, now seen corresponding path program 1 times [2019-09-10 08:45:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:34,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:34,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:34,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:34,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:34,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:34,759 INFO L87 Difference]: Start difference. First operand 14238 states and 21636 transitions. Second operand 4 states. [2019-09-10 08:45:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:34,924 INFO L93 Difference]: Finished difference Result 17550 states and 26781 transitions. [2019-09-10 08:45:34,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:34,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:45:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:34,958 INFO L225 Difference]: With dead ends: 17550 [2019-09-10 08:45:34,959 INFO L226 Difference]: Without dead ends: 17550 [2019-09-10 08:45:34,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 08:45:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2019-09-10 08:45:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 17548. [2019-09-10 08:45:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-09-10 08:45:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 26780 transitions. [2019-09-10 08:45:35,982 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 26780 transitions. Word has length 161 [2019-09-10 08:45:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:35,982 INFO L475 AbstractCegarLoop]: Abstraction has 17548 states and 26780 transitions. [2019-09-10 08:45:35,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 26780 transitions. [2019-09-10 08:45:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:35,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:35,992 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, 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 08:45:35,993 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1126058457, now seen corresponding path program 1 times [2019-09-10 08:45:35,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:35,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:36,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:36,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:36,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:36,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:36,199 INFO L87 Difference]: Start difference. First operand 17548 states and 26780 transitions. Second operand 4 states. [2019-09-10 08:45:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:36,394 INFO L93 Difference]: Finished difference Result 28867 states and 43629 transitions. [2019-09-10 08:45:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:36,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:45:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:36,459 INFO L225 Difference]: With dead ends: 28867 [2019-09-10 08:45:36,460 INFO L226 Difference]: Without dead ends: 28867 [2019-09-10 08:45:36,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:45:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28867 states. [2019-09-10 08:45:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28867 to 28833. [2019-09-10 08:45:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-10 08:45:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 43595 transitions. [2019-09-10 08:45:37,092 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 43595 transitions. Word has length 161 [2019-09-10 08:45:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:37,092 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 43595 transitions. [2019-09-10 08:45:37,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 43595 transitions. [2019-09-10 08:45:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:45:37,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:37,107 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, 1, 1, 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 08:45:37,108 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -669020024, now seen corresponding path program 1 times [2019-09-10 08:45:37,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:37,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:37,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:37,214 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 08:45:37,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:37,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:37,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:37,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:37,216 INFO L87 Difference]: Start difference. First operand 28833 states and 43595 transitions. Second operand 3 states. [2019-09-10 08:45:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,396 INFO L93 Difference]: Finished difference Result 49371 states and 73943 transitions. [2019-09-10 08:45:37,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:37,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 08:45:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,507 INFO L225 Difference]: With dead ends: 49371 [2019-09-10 08:45:37,508 INFO L226 Difference]: Without dead ends: 49371 [2019-09-10 08:45:37,508 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 08:45:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49371 states. [2019-09-10 08:45:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49371 to 49341. [2019-09-10 08:45:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49341 states. [2019-09-10 08:45:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49341 states to 49341 states and 73917 transitions. [2019-09-10 08:45:38,529 INFO L78 Accepts]: Start accepts. Automaton has 49341 states and 73917 transitions. Word has length 163 [2019-09-10 08:45:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:38,530 INFO L475 AbstractCegarLoop]: Abstraction has 49341 states and 73917 transitions. [2019-09-10 08:45:38,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 49341 states and 73917 transitions. [2019-09-10 08:45:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:45:38,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:38,556 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, 1, 1, 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 08:45:38,556 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1518159755, now seen corresponding path program 1 times [2019-09-10 08:45:38,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:38,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:38,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:38,698 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 08:45:38,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:38,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:38,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:38,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:38,700 INFO L87 Difference]: Start difference. First operand 49341 states and 73917 transitions. Second operand 4 states. [2019-09-10 08:45:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:38,861 INFO L93 Difference]: Finished difference Result 45096 states and 67526 transitions. [2019-09-10 08:45:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:38,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-10 08:45:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:39,957 INFO L225 Difference]: With dead ends: 45096 [2019-09-10 08:45:39,958 INFO L226 Difference]: Without dead ends: 45048 [2019-09-10 08:45:39,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45048 states. [2019-09-10 08:45:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45048 to 45048. [2019-09-10 08:45:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45048 states. [2019-09-10 08:45:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45048 states to 45048 states and 67463 transitions. [2019-09-10 08:45:40,657 INFO L78 Accepts]: Start accepts. Automaton has 45048 states and 67463 transitions. Word has length 163 [2019-09-10 08:45:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:40,657 INFO L475 AbstractCegarLoop]: Abstraction has 45048 states and 67463 transitions. [2019-09-10 08:45:40,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 45048 states and 67463 transitions. [2019-09-10 08:45:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:45:40,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:40,679 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, 1, 1, 1, 1, 1, 1, 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 08:45:40,679 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 42041699, now seen corresponding path program 1 times [2019-09-10 08:45:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:40,915 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 08:45:40,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:40,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:40,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:40,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:40,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:40,917 INFO L87 Difference]: Start difference. First operand 45048 states and 67463 transitions. Second operand 3 states. [2019-09-10 08:45:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:41,156 INFO L93 Difference]: Finished difference Result 76494 states and 115563 transitions. [2019-09-10 08:45:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:41,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 08:45:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:41,272 INFO L225 Difference]: With dead ends: 76494 [2019-09-10 08:45:41,272 INFO L226 Difference]: Without dead ends: 76494 [2019-09-10 08:45:41,272 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 08:45:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76494 states. [2019-09-10 08:45:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76494 to 69304. [2019-09-10 08:45:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69304 states. [2019-09-10 08:45:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69304 states to 69304 states and 105758 transitions. [2019-09-10 08:45:42,401 INFO L78 Accepts]: Start accepts. Automaton has 69304 states and 105758 transitions. Word has length 167 [2019-09-10 08:45:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:42,401 INFO L475 AbstractCegarLoop]: Abstraction has 69304 states and 105758 transitions. [2019-09-10 08:45:42,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 69304 states and 105758 transitions. [2019-09-10 08:45:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:45:42,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:42,417 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, 1, 1, 1, 1, 1, 1, 1, 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 08:45:42,417 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1492969945, now seen corresponding path program 1 times [2019-09-10 08:45:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:42,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:42,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:42,576 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 08:45:42,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:42,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:42,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:42,579 INFO L87 Difference]: Start difference. First operand 69304 states and 105758 transitions. Second operand 4 states. [2019-09-10 08:45:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:42,923 INFO L93 Difference]: Finished difference Result 61418 states and 93026 transitions. [2019-09-10 08:45:42,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:42,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 08:45:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:43,013 INFO L225 Difference]: With dead ends: 61418 [2019-09-10 08:45:43,013 INFO L226 Difference]: Without dead ends: 61418 [2019-09-10 08:45:43,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 08:45:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61418 states. [2019-09-10 08:45:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61418 to 61416. [2019-09-10 08:45:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61416 states. [2019-09-10 08:45:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61416 states to 61416 states and 93025 transitions. [2019-09-10 08:45:45,187 INFO L78 Accepts]: Start accepts. Automaton has 61416 states and 93025 transitions. Word has length 168 [2019-09-10 08:45:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:45,187 INFO L475 AbstractCegarLoop]: Abstraction has 61416 states and 93025 transitions. [2019-09-10 08:45:45,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 61416 states and 93025 transitions. [2019-09-10 08:45:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:45:45,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:45,199 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, 1, 1, 1, 1, 1, 1, 1, 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 08:45:45,199 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1315780074, now seen corresponding path program 1 times [2019-09-10 08:45:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:45,400 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 08:45:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:45,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:45,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:45,402 INFO L87 Difference]: Start difference. First operand 61416 states and 93025 transitions. Second operand 4 states. [2019-09-10 08:45:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:45,786 INFO L93 Difference]: Finished difference Result 111984 states and 167925 transitions. [2019-09-10 08:45:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:45,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 08:45:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:45,928 INFO L225 Difference]: With dead ends: 111984 [2019-09-10 08:45:45,928 INFO L226 Difference]: Without dead ends: 111984 [2019-09-10 08:45:45,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:45:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111984 states. [2019-09-10 08:45:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111984 to 111926. [2019-09-10 08:45:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111926 states. [2019-09-10 08:45:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111926 states to 111926 states and 167862 transitions. [2019-09-10 08:45:47,654 INFO L78 Accepts]: Start accepts. Automaton has 111926 states and 167862 transitions. Word has length 168 [2019-09-10 08:45:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:47,654 INFO L475 AbstractCegarLoop]: Abstraction has 111926 states and 167862 transitions. [2019-09-10 08:45:47,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 111926 states and 167862 transitions. [2019-09-10 08:45:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 08:45:47,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:47,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:47,669 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -74725554, now seen corresponding path program 1 times [2019-09-10 08:45:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:47,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:47,733 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 08:45:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:47,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:47,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:47,735 INFO L87 Difference]: Start difference. First operand 111926 states and 167862 transitions. Second operand 3 states. [2019-09-10 08:45:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:48,228 INFO L93 Difference]: Finished difference Result 223761 states and 335607 transitions. [2019-09-10 08:45:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:48,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 08:45:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:48,513 INFO L225 Difference]: With dead ends: 223761 [2019-09-10 08:45:48,513 INFO L226 Difference]: Without dead ends: 223761 [2019-09-10 08:45:48,514 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 08:45:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223761 states. [2019-09-10 08:45:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223761 to 111932. [2019-09-10 08:45:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111932 states. [2019-09-10 08:45:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111932 states to 111932 states and 167868 transitions. [2019-09-10 08:45:53,072 INFO L78 Accepts]: Start accepts. Automaton has 111932 states and 167868 transitions. Word has length 169 [2019-09-10 08:45:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:53,072 INFO L475 AbstractCegarLoop]: Abstraction has 111932 states and 167868 transitions. [2019-09-10 08:45:53,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 111932 states and 167868 transitions. [2019-09-10 08:45:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:45:53,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:53,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:53,091 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1534467413, now seen corresponding path program 1 times [2019-09-10 08:45:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:53,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:53,218 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 08:45:53,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:53,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:53,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:53,220 INFO L87 Difference]: Start difference. First operand 111932 states and 167868 transitions. Second operand 4 states. [2019-09-10 08:45:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:53,495 INFO L93 Difference]: Finished difference Result 112084 states and 168037 transitions. [2019-09-10 08:45:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:53,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-10 08:45:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:53,648 INFO L225 Difference]: With dead ends: 112084 [2019-09-10 08:45:53,648 INFO L226 Difference]: Without dead ends: 111932 [2019-09-10 08:45:53,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111932 states. [2019-09-10 08:45:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111932 to 111929. [2019-09-10 08:45:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111929 states. [2019-09-10 08:45:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111929 states to 111929 states and 167861 transitions. [2019-09-10 08:45:55,354 INFO L78 Accepts]: Start accepts. Automaton has 111929 states and 167861 transitions. Word has length 170 [2019-09-10 08:45:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:55,354 INFO L475 AbstractCegarLoop]: Abstraction has 111929 states and 167861 transitions. [2019-09-10 08:45:55,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111929 states and 167861 transitions. [2019-09-10 08:45:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:45:55,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:55,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:55,372 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash 86168618, now seen corresponding path program 1 times [2019-09-10 08:45:55,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:55,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:55,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:55,502 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 08:45:55,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:55,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:55,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:55,504 INFO L87 Difference]: Start difference. First operand 111929 states and 167861 transitions. Second operand 4 states. [2019-09-10 08:45:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:55,818 INFO L93 Difference]: Finished difference Result 112110 states and 168067 transitions. [2019-09-10 08:45:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:55,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-10 08:45:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:55,956 INFO L225 Difference]: With dead ends: 112110 [2019-09-10 08:45:55,956 INFO L226 Difference]: Without dead ends: 111923 [2019-09-10 08:45:55,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111923 states. [2019-09-10 08:45:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111923 to 111923. [2019-09-10 08:45:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111923 states. [2019-09-10 08:45:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111923 states to 111923 states and 167849 transitions. [2019-09-10 08:45:59,369 INFO L78 Accepts]: Start accepts. Automaton has 111923 states and 167849 transitions. Word has length 170 [2019-09-10 08:45:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:59,369 INFO L475 AbstractCegarLoop]: Abstraction has 111923 states and 167849 transitions. [2019-09-10 08:45:59,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 111923 states and 167849 transitions. [2019-09-10 08:45:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:45:59,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:59,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:59,390 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1231528269, now seen corresponding path program 1 times [2019-09-10 08:45:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:59,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:59,505 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 08:45:59,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:59,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:59,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:59,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:59,507 INFO L87 Difference]: Start difference. First operand 111923 states and 167849 transitions. Second operand 3 states. [2019-09-10 08:46:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:00,558 INFO L93 Difference]: Finished difference Result 161191 states and 237911 transitions. [2019-09-10 08:46:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:00,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:46:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:00,775 INFO L225 Difference]: With dead ends: 161191 [2019-09-10 08:46:00,775 INFO L226 Difference]: Without dead ends: 161191 [2019-09-10 08:46:00,775 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 08:46:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161191 states. [2019-09-10 08:46:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161191 to 161133. [2019-09-10 08:46:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161133 states. [2019-09-10 08:46:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161133 states to 161133 states and 237848 transitions. [2019-09-10 08:46:04,990 INFO L78 Accepts]: Start accepts. Automaton has 161133 states and 237848 transitions. Word has length 170 [2019-09-10 08:46:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:04,991 INFO L475 AbstractCegarLoop]: Abstraction has 161133 states and 237848 transitions. [2019-09-10 08:46:04,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 161133 states and 237848 transitions. [2019-09-10 08:46:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:46:05,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:05,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:05,013 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 904934381, now seen corresponding path program 1 times [2019-09-10 08:46:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:05,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:05,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:05,119 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 08:46:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:05,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:05,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:05,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:05,121 INFO L87 Difference]: Start difference. First operand 161133 states and 237848 transitions. Second operand 4 states. [2019-09-10 08:46:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:05,721 INFO L93 Difference]: Finished difference Result 222762 states and 330707 transitions. [2019-09-10 08:46:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:05,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:46:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:06,062 INFO L225 Difference]: With dead ends: 222762 [2019-09-10 08:46:06,063 INFO L226 Difference]: Without dead ends: 222762 [2019-09-10 08:46:06,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:46:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222762 states. [2019-09-10 08:46:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222762 to 160949. [2019-09-10 08:46:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160949 states. [2019-09-10 08:46:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160949 states to 160949 states and 237404 transitions. [2019-09-10 08:46:09,318 INFO L78 Accepts]: Start accepts. Automaton has 160949 states and 237404 transitions. Word has length 175 [2019-09-10 08:46:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:09,319 INFO L475 AbstractCegarLoop]: Abstraction has 160949 states and 237404 transitions. [2019-09-10 08:46:09,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 160949 states and 237404 transitions. [2019-09-10 08:46:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:46:09,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:09,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:09,342 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1101316072, now seen corresponding path program 1 times [2019-09-10 08:46:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:09,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:09,516 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 08:46:09,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:46:09,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:09,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:46:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:46:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:46:09,518 INFO L87 Difference]: Start difference. First operand 160949 states and 237404 transitions. Second operand 8 states. [2019-09-10 08:46:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:13,390 INFO L93 Difference]: Finished difference Result 419077 states and 616088 transitions. [2019-09-10 08:46:13,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:46:13,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-10 08:46:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:13,983 INFO L225 Difference]: With dead ends: 419077 [2019-09-10 08:46:13,983 INFO L226 Difference]: Without dead ends: 419077 [2019-09-10 08:46:13,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:46:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419077 states. [2019-09-10 08:46:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419077 to 187921. [2019-09-10 08:46:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187921 states. [2019-09-10 08:46:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187921 states to 187921 states and 278916 transitions. [2019-09-10 08:46:21,896 INFO L78 Accepts]: Start accepts. Automaton has 187921 states and 278916 transitions. Word has length 175 [2019-09-10 08:46:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:21,897 INFO L475 AbstractCegarLoop]: Abstraction has 187921 states and 278916 transitions. [2019-09-10 08:46:21,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:46:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 187921 states and 278916 transitions. [2019-09-10 08:46:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:46:21,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:21,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:21,920 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1292977437, now seen corresponding path program 1 times [2019-09-10 08:46:21,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:21,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:21,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:21,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:21,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:22,111 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 08:46:22,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:22,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:22,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:22,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:22,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:22,113 INFO L87 Difference]: Start difference. First operand 187921 states and 278916 transitions. Second operand 4 states. [2019-09-10 08:46:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:22,799 INFO L93 Difference]: Finished difference Result 174409 states and 258950 transitions. [2019-09-10 08:46:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:22,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:46:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:23,151 INFO L225 Difference]: With dead ends: 174409 [2019-09-10 08:46:23,151 INFO L226 Difference]: Without dead ends: 174409 [2019-09-10 08:46:23,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:46:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174409 states. [2019-09-10 08:46:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174409 to 174339. [2019-09-10 08:46:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174339 states. [2019-09-10 08:46:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174339 states to 174339 states and 258879 transitions. [2019-09-10 08:46:25,978 INFO L78 Accepts]: Start accepts. Automaton has 174339 states and 258879 transitions. Word has length 175 [2019-09-10 08:46:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:25,978 INFO L475 AbstractCegarLoop]: Abstraction has 174339 states and 258879 transitions. [2019-09-10 08:46:25,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 174339 states and 258879 transitions. [2019-09-10 08:46:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:46:26,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:26,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:26,000 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash -837566264, now seen corresponding path program 1 times [2019-09-10 08:46:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:26,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:26,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:26,204 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 08:46:26,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:26,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:26,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:26,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:26,206 INFO L87 Difference]: Start difference. First operand 174339 states and 258879 transitions. Second operand 4 states. [2019-09-10 08:46:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:26,887 INFO L93 Difference]: Finished difference Result 174559 states and 259110 transitions. [2019-09-10 08:46:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:26,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-10 08:46:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:27,251 INFO L225 Difference]: With dead ends: 174559 [2019-09-10 08:46:27,251 INFO L226 Difference]: Without dead ends: 174559 [2019-09-10 08:46:27,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:46:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174559 states. [2019-09-10 08:46:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174559 to 174441. [2019-09-10 08:46:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174441 states. [2019-09-10 08:46:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174441 states to 174441 states and 258979 transitions. [2019-09-10 08:46:32,776 INFO L78 Accepts]: Start accepts. Automaton has 174441 states and 258979 transitions. Word has length 177 [2019-09-10 08:46:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:32,776 INFO L475 AbstractCegarLoop]: Abstraction has 174441 states and 258979 transitions. [2019-09-10 08:46:32,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 174441 states and 258979 transitions. [2019-09-10 08:46:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:46:32,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:32,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:32,797 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1142204644, now seen corresponding path program 1 times [2019-09-10 08:46:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:32,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:32,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:32,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:32,856 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 08:46:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:32,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:32,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:32,858 INFO L87 Difference]: Start difference. First operand 174441 states and 258979 transitions. Second operand 3 states. [2019-09-10 08:46:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:33,720 INFO L93 Difference]: Finished difference Result 348671 states and 517709 transitions. [2019-09-10 08:46:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:33,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 08:46:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:34,286 INFO L225 Difference]: With dead ends: 348671 [2019-09-10 08:46:34,286 INFO L226 Difference]: Without dead ends: 348671 [2019-09-10 08:46:34,286 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 08:46:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348671 states. [2019-09-10 08:46:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348671 to 174451. [2019-09-10 08:46:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174451 states. [2019-09-10 08:46:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174451 states to 174451 states and 258989 transitions. [2019-09-10 08:46:43,337 INFO L78 Accepts]: Start accepts. Automaton has 174451 states and 258989 transitions. Word has length 178 [2019-09-10 08:46:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:43,338 INFO L475 AbstractCegarLoop]: Abstraction has 174451 states and 258989 transitions. [2019-09-10 08:46:43,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 174451 states and 258989 transitions. [2019-09-10 08:46:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:46:43,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:43,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:43,354 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1172365455, now seen corresponding path program 1 times [2019-09-10 08:46:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:43,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:43,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:43,447 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 08:46:43,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:43,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:43,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:43,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:43,448 INFO L87 Difference]: Start difference. First operand 174451 states and 258989 transitions. Second operand 4 states. [2019-09-10 08:46:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:44,272 INFO L93 Difference]: Finished difference Result 262093 states and 392698 transitions. [2019-09-10 08:46:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:44,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 08:46:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:44,667 INFO L225 Difference]: With dead ends: 262093 [2019-09-10 08:46:44,667 INFO L226 Difference]: Without dead ends: 262093 [2019-09-10 08:46:44,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:46:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262093 states. [2019-09-10 08:46:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262093 to 174311. [2019-09-10 08:46:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174311 states. [2019-09-10 08:46:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174311 states to 174311 states and 258637 transitions. [2019-09-10 08:46:47,333 INFO L78 Accepts]: Start accepts. Automaton has 174311 states and 258637 transitions. Word has length 179 [2019-09-10 08:46:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:47,334 INFO L475 AbstractCegarLoop]: Abstraction has 174311 states and 258637 transitions. [2019-09-10 08:46:47,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 174311 states and 258637 transitions. [2019-09-10 08:46:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:46:47,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:47,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:47,350 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2064185023, now seen corresponding path program 1 times [2019-09-10 08:46:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:47,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:47,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:47,496 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 08:46:47,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:47,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:46:47,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:47,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:46:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:46:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:46:47,498 INFO L87 Difference]: Start difference. First operand 174311 states and 258637 transitions. Second operand 5 states. [2019-09-10 08:46:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:49,062 INFO L93 Difference]: Finished difference Result 174313 states and 257714 transitions. [2019-09-10 08:46:49,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:46:49,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-09-10 08:46:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:49,262 INFO L225 Difference]: With dead ends: 174313 [2019-09-10 08:46:49,262 INFO L226 Difference]: Without dead ends: 174313 [2019-09-10 08:46:49,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:46:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174313 states. [2019-09-10 08:46:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174313 to 174311. [2019-09-10 08:46:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174311 states. [2019-09-10 08:46:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174311 states to 174311 states and 257713 transitions. [2019-09-10 08:46:51,889 INFO L78 Accepts]: Start accepts. Automaton has 174311 states and 257713 transitions. Word has length 179 [2019-09-10 08:46:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:51,889 INFO L475 AbstractCegarLoop]: Abstraction has 174311 states and 257713 transitions. [2019-09-10 08:46:51,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:46:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 174311 states and 257713 transitions. [2019-09-10 08:46:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:46:51,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:51,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:51,906 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1768561050, now seen corresponding path program 1 times [2019-09-10 08:46:51,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:51,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:51,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:52,066 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 08:46:52,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:52,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:46:52,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:52,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:46:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:46:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:46:52,068 INFO L87 Difference]: Start difference. First operand 174311 states and 257713 transitions. Second operand 8 states. [2019-09-10 08:46:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:53,903 INFO L93 Difference]: Finished difference Result 473071 states and 692070 transitions. [2019-09-10 08:46:53,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:46:53,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-10 08:46:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:54,572 INFO L225 Difference]: With dead ends: 473071 [2019-09-10 08:46:54,572 INFO L226 Difference]: Without dead ends: 473071 [2019-09-10 08:46:54,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:46:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473071 states. [2019-09-10 08:47:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473071 to 131795. [2019-09-10 08:47:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131795 states. [2019-09-10 08:47:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131795 states to 131795 states and 190751 transitions. [2019-09-10 08:47:02,371 INFO L78 Accepts]: Start accepts. Automaton has 131795 states and 190751 transitions. Word has length 179 [2019-09-10 08:47:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:02,372 INFO L475 AbstractCegarLoop]: Abstraction has 131795 states and 190751 transitions. [2019-09-10 08:47:02,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:47:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 131795 states and 190751 transitions. [2019-09-10 08:47:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:47:02,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:02,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:02,393 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:02,394 INFO L82 PathProgramCache]: Analyzing trace with hash 313385232, now seen corresponding path program 1 times [2019-09-10 08:47:02,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:02,563 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 08:47:02,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:02,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:02,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:02,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:02,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:02,565 INFO L87 Difference]: Start difference. First operand 131795 states and 190751 transitions. Second operand 4 states. [2019-09-10 08:47:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:03,187 INFO L93 Difference]: Finished difference Result 132254 states and 191240 transitions. [2019-09-10 08:47:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:03,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 08:47:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:03,458 INFO L225 Difference]: With dead ends: 132254 [2019-09-10 08:47:03,458 INFO L226 Difference]: Without dead ends: 132254 [2019-09-10 08:47:03,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:47:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132254 states. [2019-09-10 08:47:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132254 to 132041. [2019-09-10 08:47:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132041 states. [2019-09-10 08:47:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132041 states to 132041 states and 190997 transitions. [2019-09-10 08:47:05,772 INFO L78 Accepts]: Start accepts. Automaton has 132041 states and 190997 transitions. Word has length 179 [2019-09-10 08:47:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:05,772 INFO L475 AbstractCegarLoop]: Abstraction has 132041 states and 190997 transitions. [2019-09-10 08:47:05,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 132041 states and 190997 transitions. [2019-09-10 08:47:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:47:05,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:05,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:05,796 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1060941927, now seen corresponding path program 1 times [2019-09-10 08:47:05,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:05,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:05,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:05,918 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 08:47:05,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:05,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:05,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:05,920 INFO L87 Difference]: Start difference. First operand 132041 states and 190997 transitions. Second operand 4 states. [2019-09-10 08:47:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:07,186 INFO L93 Difference]: Finished difference Result 118441 states and 171546 transitions. [2019-09-10 08:47:07,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:07,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 08:47:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:07,374 INFO L225 Difference]: With dead ends: 118441 [2019-09-10 08:47:07,374 INFO L226 Difference]: Without dead ends: 118339 [2019-09-10 08:47:07,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118339 states. [2019-09-10 08:47:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118339 to 118339. [2019-09-10 08:47:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118339 states. [2019-09-10 08:47:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118339 states to 118339 states and 171444 transitions. [2019-09-10 08:47:08,638 INFO L78 Accepts]: Start accepts. Automaton has 118339 states and 171444 transitions. Word has length 179 [2019-09-10 08:47:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:08,638 INFO L475 AbstractCegarLoop]: Abstraction has 118339 states and 171444 transitions. [2019-09-10 08:47:08,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 118339 states and 171444 transitions. [2019-09-10 08:47:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:47:08,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:08,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:08,659 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash 501529733, now seen corresponding path program 1 times [2019-09-10 08:47:08,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:08,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:08,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:10,510 WARN L188 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-10 08:47:10,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 08:47:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:47:10,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:10,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:47:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:47:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:47:10,996 INFO L87 Difference]: Start difference. First operand 118339 states and 171444 transitions. Second operand 21 states. [2019-09-10 08:47:11,897 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 08:47:12,059 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:47:12,421 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:47:12,670 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:47:12,975 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:47:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:16,186 INFO L93 Difference]: Finished difference Result 121823 states and 175517 transitions. [2019-09-10 08:47:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:47:16,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-10 08:47:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:16,313 INFO L225 Difference]: With dead ends: 121823 [2019-09-10 08:47:16,313 INFO L226 Difference]: Without dead ends: 121823 [2019-09-10 08:47:16,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:47:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121823 states. [2019-09-10 08:47:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121823 to 119058. [2019-09-10 08:47:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119058 states. [2019-09-10 08:47:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119058 states to 119058 states and 172282 transitions. [2019-09-10 08:47:17,961 INFO L78 Accepts]: Start accepts. Automaton has 119058 states and 172282 transitions. Word has length 181 [2019-09-10 08:47:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:17,962 INFO L475 AbstractCegarLoop]: Abstraction has 119058 states and 172282 transitions. [2019-09-10 08:47:17,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:47:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119058 states and 172282 transitions. [2019-09-10 08:47:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:47:17,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:17,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:17,979 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1597208288, now seen corresponding path program 1 times [2019-09-10 08:47:17,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:17,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:18,068 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 08:47:18,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:18,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:18,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:18,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:18,070 INFO L87 Difference]: Start difference. First operand 119058 states and 172282 transitions. Second operand 4 states. [2019-09-10 08:47:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:18,860 INFO L93 Difference]: Finished difference Result 213711 states and 315883 transitions. [2019-09-10 08:47:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:18,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-10 08:47:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:19,132 INFO L225 Difference]: With dead ends: 213711 [2019-09-10 08:47:19,132 INFO L226 Difference]: Without dead ends: 213711 [2019-09-10 08:47:19,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213711 states. [2019-09-10 08:47:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213711 to 116115. [2019-09-10 08:47:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116115 states. [2019-09-10 08:47:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116115 states to 116115 states and 168706 transitions. [2019-09-10 08:47:21,203 INFO L78 Accepts]: Start accepts. Automaton has 116115 states and 168706 transitions. Word has length 181 [2019-09-10 08:47:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:21,203 INFO L475 AbstractCegarLoop]: Abstraction has 116115 states and 168706 transitions. [2019-09-10 08:47:21,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 116115 states and 168706 transitions. [2019-09-10 08:47:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:47:21,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:21,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:21,219 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash 355267511, now seen corresponding path program 1 times [2019-09-10 08:47:21,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:21,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:22,800 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 08:47:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:47:22,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:22,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:47:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:47:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:47:22,801 INFO L87 Difference]: Start difference. First operand 116115 states and 168706 transitions. Second operand 21 states. [2019-09-10 08:47:23,712 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 08:47:23,906 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 08:47:24,441 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:47:24,652 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 08:47:24,855 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:47:25,050 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:47:25,211 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:47:25,393 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 08:47:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:28,172 INFO L93 Difference]: Finished difference Result 121410 states and 174922 transitions. [2019-09-10 08:47:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:47:28,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-10 08:47:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:28,297 INFO L225 Difference]: With dead ends: 121410 [2019-09-10 08:47:28,298 INFO L226 Difference]: Without dead ends: 121410 [2019-09-10 08:47:28,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:47:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121410 states. [2019-09-10 08:47:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121410 to 118153. [2019-09-10 08:47:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118153 states. [2019-09-10 08:47:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118153 states to 118153 states and 171100 transitions. [2019-09-10 08:47:29,663 INFO L78 Accepts]: Start accepts. Automaton has 118153 states and 171100 transitions. Word has length 181 [2019-09-10 08:47:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:29,663 INFO L475 AbstractCegarLoop]: Abstraction has 118153 states and 171100 transitions. [2019-09-10 08:47:29,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:47:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 118153 states and 171100 transitions. [2019-09-10 08:47:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:29,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:29,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:29,679 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 541451344, now seen corresponding path program 1 times [2019-09-10 08:47:29,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:29,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:29,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:29,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:29,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:29,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:29,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:29,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:29,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:29,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:29,741 INFO L87 Difference]: Start difference. First operand 118153 states and 171100 transitions. Second operand 3 states. [2019-09-10 08:47:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:30,116 INFO L93 Difference]: Finished difference Result 131858 states and 189298 transitions. [2019-09-10 08:47:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:30,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:30,286 INFO L225 Difference]: With dead ends: 131858 [2019-09-10 08:47:30,287 INFO L226 Difference]: Without dead ends: 131858 [2019-09-10 08:47:30,287 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 08:47:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131858 states. [2019-09-10 08:47:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131858 to 117139. [2019-09-10 08:47:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117139 states. [2019-09-10 08:47:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117139 states to 117139 states and 169204 transitions. [2019-09-10 08:47:31,891 INFO L78 Accepts]: Start accepts. Automaton has 117139 states and 169204 transitions. Word has length 182 [2019-09-10 08:47:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 117139 states and 169204 transitions. [2019-09-10 08:47:31,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 117139 states and 169204 transitions. [2019-09-10 08:47:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:31,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:31,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:31,908 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash -30835057, now seen corresponding path program 1 times [2019-09-10 08:47:31,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:31,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:31,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:31,982 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 08:47:31,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:31,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:31,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:31,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:31,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:31,986 INFO L87 Difference]: Start difference. First operand 117139 states and 169204 transitions. Second operand 3 states. [2019-09-10 08:47:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:32,343 INFO L93 Difference]: Finished difference Result 116351 states and 167785 transitions. [2019-09-10 08:47:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:32,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:32,471 INFO L225 Difference]: With dead ends: 116351 [2019-09-10 08:47:32,471 INFO L226 Difference]: Without dead ends: 116351 [2019-09-10 08:47:32,471 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 08:47:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116351 states. [2019-09-10 08:47:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116351 to 116351. [2019-09-10 08:47:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116351 states. [2019-09-10 08:47:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116351 states to 116351 states and 167785 transitions. [2019-09-10 08:47:34,008 INFO L78 Accepts]: Start accepts. Automaton has 116351 states and 167785 transitions. Word has length 182 [2019-09-10 08:47:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:34,009 INFO L475 AbstractCegarLoop]: Abstraction has 116351 states and 167785 transitions. [2019-09-10 08:47:34,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 116351 states and 167785 transitions. [2019-09-10 08:47:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:34,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:34,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:34,027 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1968335284, now seen corresponding path program 1 times [2019-09-10 08:47:34,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:34,115 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 08:47:34,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:34,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:34,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:34,116 INFO L87 Difference]: Start difference. First operand 116351 states and 167785 transitions. Second operand 3 states. [2019-09-10 08:47:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:34,452 INFO L93 Difference]: Finished difference Result 116548 states and 167100 transitions. [2019-09-10 08:47:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:34,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:34,591 INFO L225 Difference]: With dead ends: 116548 [2019-09-10 08:47:34,592 INFO L226 Difference]: Without dead ends: 116548 [2019-09-10 08:47:34,592 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 08:47:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116548 states. [2019-09-10 08:47:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116548 to 115336. [2019-09-10 08:47:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115336 states. [2019-09-10 08:47:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115336 states to 115336 states and 165888 transitions. [2019-09-10 08:47:36,197 INFO L78 Accepts]: Start accepts. Automaton has 115336 states and 165888 transitions. Word has length 182 [2019-09-10 08:47:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:36,198 INFO L475 AbstractCegarLoop]: Abstraction has 115336 states and 165888 transitions. [2019-09-10 08:47:36,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 115336 states and 165888 transitions. [2019-09-10 08:47:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:36,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:36,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:36,222 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1383724225, now seen corresponding path program 1 times [2019-09-10 08:47:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:36,288 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 08:47:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:36,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:36,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:36,290 INFO L87 Difference]: Start difference. First operand 115336 states and 165888 transitions. Second operand 3 states. [2019-09-10 08:47:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:36,726 INFO L93 Difference]: Finished difference Result 114399 states and 164181 transitions. [2019-09-10 08:47:36,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:36,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:36,871 INFO L225 Difference]: With dead ends: 114399 [2019-09-10 08:47:36,871 INFO L226 Difference]: Without dead ends: 114399 [2019-09-10 08:47:36,871 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 08:47:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114399 states. [2019-09-10 08:47:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114399 to 114399. [2019-09-10 08:47:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114399 states. [2019-09-10 08:47:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114399 states to 114399 states and 164181 transitions. [2019-09-10 08:47:38,622 INFO L78 Accepts]: Start accepts. Automaton has 114399 states and 164181 transitions. Word has length 182 [2019-09-10 08:47:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:38,622 INFO L475 AbstractCegarLoop]: Abstraction has 114399 states and 164181 transitions. [2019-09-10 08:47:38,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 114399 states and 164181 transitions. [2019-09-10 08:47:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:38,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:38,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:38,638 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash -405784487, now seen corresponding path program 1 times [2019-09-10 08:47:38,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:38,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:38,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:38,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:38,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:38,722 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 08:47:38,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:38,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:38,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:38,724 INFO L87 Difference]: Start difference. First operand 114399 states and 164181 transitions. Second operand 3 states. [2019-09-10 08:47:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:39,212 INFO L93 Difference]: Finished difference Result 116695 states and 165902 transitions. [2019-09-10 08:47:39,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:39,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:39,360 INFO L225 Difference]: With dead ends: 116695 [2019-09-10 08:47:39,361 INFO L226 Difference]: Without dead ends: 116695 [2019-09-10 08:47:39,361 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 08:47:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116695 states. [2019-09-10 08:47:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116695 to 114106. [2019-09-10 08:47:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114106 states. [2019-09-10 08:47:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114106 states to 114106 states and 163093 transitions. [2019-09-10 08:47:41,343 INFO L78 Accepts]: Start accepts. Automaton has 114106 states and 163093 transitions. Word has length 182 [2019-09-10 08:47:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:41,343 INFO L475 AbstractCegarLoop]: Abstraction has 114106 states and 163093 transitions. [2019-09-10 08:47:41,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 114106 states and 163093 transitions. [2019-09-10 08:47:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:41,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:41,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:41,358 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2044233080, now seen corresponding path program 1 times [2019-09-10 08:47:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:41,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:41,424 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 08:47:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:41,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:41,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:41,426 INFO L87 Difference]: Start difference. First operand 114106 states and 163093 transitions. Second operand 3 states. [2019-09-10 08:47:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:41,865 INFO L93 Difference]: Finished difference Result 120633 states and 171321 transitions. [2019-09-10 08:47:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:41,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:47:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:42,029 INFO L225 Difference]: With dead ends: 120633 [2019-09-10 08:47:42,029 INFO L226 Difference]: Without dead ends: 120633 [2019-09-10 08:47:42,029 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 08:47:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120633 states. [2019-09-10 08:47:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120633 to 111895. [2019-09-10 08:47:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111895 states. [2019-09-10 08:47:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111895 states to 111895 states and 159787 transitions. [2019-09-10 08:47:43,230 INFO L78 Accepts]: Start accepts. Automaton has 111895 states and 159787 transitions. Word has length 182 [2019-09-10 08:47:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:43,230 INFO L475 AbstractCegarLoop]: Abstraction has 111895 states and 159787 transitions. [2019-09-10 08:47:43,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 111895 states and 159787 transitions. [2019-09-10 08:47:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:47:43,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:43,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:43,243 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1093436456, now seen corresponding path program 1 times [2019-09-10 08:47:43,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:43,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:43,467 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 08:47:43,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:47:43,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:43,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:47:43,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:47:43,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:47:43,468 INFO L87 Difference]: Start difference. First operand 111895 states and 159787 transitions. Second operand 10 states. [2019-09-10 08:47:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:44,232 INFO L93 Difference]: Finished difference Result 110929 states and 157855 transitions. [2019-09-10 08:47:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:47:44,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 08:47:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:44,373 INFO L225 Difference]: With dead ends: 110929 [2019-09-10 08:47:44,373 INFO L226 Difference]: Without dead ends: 110929 [2019-09-10 08:47:44,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:47:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110929 states. [2019-09-10 08:47:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110929 to 110929. [2019-09-10 08:47:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110929 states. [2019-09-10 08:47:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110929 states to 110929 states and 157855 transitions. [2019-09-10 08:47:45,463 INFO L78 Accepts]: Start accepts. Automaton has 110929 states and 157855 transitions. Word has length 184 [2019-09-10 08:47:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:45,463 INFO L475 AbstractCegarLoop]: Abstraction has 110929 states and 157855 transitions. [2019-09-10 08:47:45,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:47:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 110929 states and 157855 transitions. [2019-09-10 08:47:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:47:45,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:45,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:45,477 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1418044781, now seen corresponding path program 1 times [2019-09-10 08:47:45,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:45,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:46,807 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 08:47:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:47:46,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:46,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:47:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:47:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:47:46,809 INFO L87 Difference]: Start difference. First operand 110929 states and 157855 transitions. Second operand 21 states. [2019-09-10 08:47:47,333 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-09-10 08:47:47,806 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:47:48,021 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 08:47:48,265 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 08:47:48,578 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:47:48,757 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:47:49,312 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:47:50,101 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-09-10 08:47:50,612 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:47:50,779 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:47:50,982 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:47:51,227 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 08:47:51,451 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-09-10 08:47:51,705 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:47:52,113 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:47:52,947 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:47:53,568 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:47:56,611 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:47:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:57,849 INFO L93 Difference]: Finished difference Result 159654 states and 226273 transitions. [2019-09-10 08:47:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:47:57,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 08:47:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:58,031 INFO L225 Difference]: With dead ends: 159654 [2019-09-10 08:47:58,032 INFO L226 Difference]: Without dead ends: 159654 [2019-09-10 08:47:58,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:47:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159654 states. [2019-09-10 08:47:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159654 to 136279. [2019-09-10 08:47:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136279 states. [2019-09-10 08:47:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136279 states to 136279 states and 194179 transitions. [2019-09-10 08:47:59,953 INFO L78 Accepts]: Start accepts. Automaton has 136279 states and 194179 transitions. Word has length 184 [2019-09-10 08:47:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:59,953 INFO L475 AbstractCegarLoop]: Abstraction has 136279 states and 194179 transitions. [2019-09-10 08:47:59,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:47:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 136279 states and 194179 transitions. [2019-09-10 08:47:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:47:59,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:59,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:59,969 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1637644873, now seen corresponding path program 1 times [2019-09-10 08:47:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:00,168 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 08:48:00,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:00,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:48:00,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:00,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:48:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:48:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:00,171 INFO L87 Difference]: Start difference. First operand 136279 states and 194179 transitions. Second operand 8 states. [2019-09-10 08:48:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:00,483 INFO L93 Difference]: Finished difference Result 93819 states and 130992 transitions. [2019-09-10 08:48:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:00,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-09-10 08:48:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:00,590 INFO L225 Difference]: With dead ends: 93819 [2019-09-10 08:48:00,590 INFO L226 Difference]: Without dead ends: 93819 [2019-09-10 08:48:00,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:48:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93819 states. [2019-09-10 08:48:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93819 to 93817. [2019-09-10 08:48:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93817 states. [2019-09-10 08:48:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93817 states to 93817 states and 130991 transitions. [2019-09-10 08:48:02,095 INFO L78 Accepts]: Start accepts. Automaton has 93817 states and 130991 transitions. Word has length 184 [2019-09-10 08:48:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:02,096 INFO L475 AbstractCegarLoop]: Abstraction has 93817 states and 130991 transitions. [2019-09-10 08:48:02,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:48:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 93817 states and 130991 transitions. [2019-09-10 08:48:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:02,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:02,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:02,111 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash -756648636, now seen corresponding path program 1 times [2019-09-10 08:48:02,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:02,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:02,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:02,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:02,965 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 08:48:02,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:02,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:48:02,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:02,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:48:02,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:48:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:48:02,968 INFO L87 Difference]: Start difference. First operand 93817 states and 130991 transitions. Second operand 22 states. [2019-09-10 08:48:03,808 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:48:03,956 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:48:04,242 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:48:04,481 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:48:05,978 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 08:48:06,143 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 08:48:06,320 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 08:48:06,846 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 08:48:07,136 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 08:48:07,668 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 08:48:07,989 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-09-10 08:48:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:09,390 INFO L93 Difference]: Finished difference Result 95744 states and 133103 transitions. [2019-09-10 08:48:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:48:09,390 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 08:48:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:09,514 INFO L225 Difference]: With dead ends: 95744 [2019-09-10 08:48:09,514 INFO L226 Difference]: Without dead ends: 95744 [2019-09-10 08:48:09,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=476, Invalid=1504, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:48:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95744 states. [2019-09-10 08:48:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95744 to 94277. [2019-09-10 08:48:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94277 states. [2019-09-10 08:48:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94277 states to 94277 states and 131479 transitions. [2019-09-10 08:48:10,517 INFO L78 Accepts]: Start accepts. Automaton has 94277 states and 131479 transitions. Word has length 184 [2019-09-10 08:48:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:10,517 INFO L475 AbstractCegarLoop]: Abstraction has 94277 states and 131479 transitions. [2019-09-10 08:48:10,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 94277 states and 131479 transitions. [2019-09-10 08:48:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:10,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:10,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:10,532 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash 926940289, now seen corresponding path program 1 times [2019-09-10 08:48:10,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:10,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:10,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:12,147 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 08:48:12,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:48:12,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:12,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:48:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:48:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:48:12,149 INFO L87 Difference]: Start difference. First operand 94277 states and 131479 transitions. Second operand 21 states. [2019-09-10 08:48:12,963 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:48:13,156 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:48:13,440 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:48:13,615 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:48:14,682 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:48:14,842 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:48:15,306 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:48:16,329 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 08:48:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:17,683 INFO L93 Difference]: Finished difference Result 96139 states and 133553 transitions. [2019-09-10 08:48:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:48:17,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 08:48:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:17,789 INFO L225 Difference]: With dead ends: 96139 [2019-09-10 08:48:17,789 INFO L226 Difference]: Without dead ends: 96139 [2019-09-10 08:48:17,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:48:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96139 states. [2019-09-10 08:48:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96139 to 94264. [2019-09-10 08:48:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94264 states. [2019-09-10 08:48:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94264 states to 94264 states and 131434 transitions. [2019-09-10 08:48:18,763 INFO L78 Accepts]: Start accepts. Automaton has 94264 states and 131434 transitions. Word has length 184 [2019-09-10 08:48:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:18,763 INFO L475 AbstractCegarLoop]: Abstraction has 94264 states and 131434 transitions. [2019-09-10 08:48:18,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:48:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94264 states and 131434 transitions. [2019-09-10 08:48:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:18,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:18,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:18,777 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 207952625, now seen corresponding path program 1 times [2019-09-10 08:48:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:20,331 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 08:48:20,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:20,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:48:20,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:20,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:48:20,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:48:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:48:20,333 INFO L87 Difference]: Start difference. First operand 94264 states and 131434 transitions. Second operand 22 states. [2019-09-10 08:48:21,090 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:48:21,479 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:48:21,697 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:48:21,886 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:48:22,086 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:48:22,593 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-10 08:48:23,277 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-09-10 08:48:23,630 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 08:48:23,832 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:48:24,082 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-09-10 08:48:24,335 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-09-10 08:48:24,677 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:48:24,985 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 08:48:25,204 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 08:48:26,985 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:48:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:30,645 INFO L93 Difference]: Finished difference Result 103244 states and 143400 transitions. [2019-09-10 08:48:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 08:48:30,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 08:48:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:30,744 INFO L225 Difference]: With dead ends: 103244 [2019-09-10 08:48:30,744 INFO L226 Difference]: Without dead ends: 103244 [2019-09-10 08:48:30,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=679, Invalid=2861, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:48:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103244 states. [2019-09-10 08:48:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103244 to 95109. [2019-09-10 08:48:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95109 states. [2019-09-10 08:48:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95109 states to 95109 states and 132387 transitions. [2019-09-10 08:48:31,599 INFO L78 Accepts]: Start accepts. Automaton has 95109 states and 132387 transitions. Word has length 184 [2019-09-10 08:48:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:31,600 INFO L475 AbstractCegarLoop]: Abstraction has 95109 states and 132387 transitions. [2019-09-10 08:48:31,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 95109 states and 132387 transitions. [2019-09-10 08:48:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:31,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:31,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:31,614 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:31,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:31,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1143453222, now seen corresponding path program 1 times [2019-09-10 08:48:31,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:31,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:31,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:31,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:31,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:32,735 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 08:48:32,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:32,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:48:32,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:32,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:48:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:48:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:48:32,737 INFO L87 Difference]: Start difference. First operand 95109 states and 132387 transitions. Second operand 22 states. [2019-09-10 08:48:33,577 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:48:33,828 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:48:34,099 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:48:35,123 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2019-09-10 08:48:35,336 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:48:35,499 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:48:35,682 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:48:35,844 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-09-10 08:48:36,034 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 08:48:36,285 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 08:48:36,758 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 08:48:36,974 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:48:37,296 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 08:48:38,548 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-10 08:48:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:39,193 INFO L93 Difference]: Finished difference Result 99460 states and 137068 transitions. [2019-09-10 08:48:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:48:39,193 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 08:48:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:39,332 INFO L225 Difference]: With dead ends: 99460 [2019-09-10 08:48:39,332 INFO L226 Difference]: Without dead ends: 99460 [2019-09-10 08:48:39,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=506, Invalid=1564, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:48:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99460 states. [2019-09-10 08:48:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99460 to 95739. [2019-09-10 08:48:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95739 states. [2019-09-10 08:48:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95739 states to 95739 states and 133062 transitions. [2019-09-10 08:48:40,442 INFO L78 Accepts]: Start accepts. Automaton has 95739 states and 133062 transitions. Word has length 184 [2019-09-10 08:48:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:40,442 INFO L475 AbstractCegarLoop]: Abstraction has 95739 states and 133062 transitions. [2019-09-10 08:48:40,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 95739 states and 133062 transitions. [2019-09-10 08:48:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:40,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:40,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:40,461 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 519198276, now seen corresponding path program 1 times [2019-09-10 08:48:40,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:40,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:40,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:41,971 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 08:48:41,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:41,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:48:41,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:41,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:48:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:48:41,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:48:41,973 INFO L87 Difference]: Start difference. First operand 95739 states and 133062 transitions. Second operand 22 states. [2019-09-10 08:48:42,686 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:48:42,883 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 08:48:43,100 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 08:48:43,550 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:48:43,749 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:48:43,943 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:48:44,448 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:48:44,678 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 08:48:44,964 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:48:45,150 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:48:45,706 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:48:45,928 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:48:46,206 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:48:46,351 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:48:46,585 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:48:46,824 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:48:47,025 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:48:47,342 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:48:47,508 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:48:47,817 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:48:47,956 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:48:48,441 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:48:48,636 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:48:48,853 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:48:49,140 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:48:49,689 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:48:49,876 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:48:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:52,291 INFO L93 Difference]: Finished difference Result 106074 states and 146942 transitions. [2019-09-10 08:48:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 08:48:52,291 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 08:48:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:52,447 INFO L225 Difference]: With dead ends: 106074 [2019-09-10 08:48:52,448 INFO L226 Difference]: Without dead ends: 106074 [2019-09-10 08:48:52,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=750, Invalid=2910, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:48:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106074 states. [2019-09-10 08:48:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106074 to 100241. [2019-09-10 08:48:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100241 states. [2019-09-10 08:48:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100241 states to 100241 states and 139462 transitions. [2019-09-10 08:48:53,933 INFO L78 Accepts]: Start accepts. Automaton has 100241 states and 139462 transitions. Word has length 184 [2019-09-10 08:48:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:53,933 INFO L475 AbstractCegarLoop]: Abstraction has 100241 states and 139462 transitions. [2019-09-10 08:48:53,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 100241 states and 139462 transitions. [2019-09-10 08:48:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:48:53,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:53,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:53,952 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:53,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1281227641, now seen corresponding path program 1 times [2019-09-10 08:48:53,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:53,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:53,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:53,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:54,934 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 08:48:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:48:54,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:54,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:48:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:48:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:48:54,936 INFO L87 Difference]: Start difference. First operand 100241 states and 139462 transitions. Second operand 15 states. [2019-09-10 08:48:55,574 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-10 08:48:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:57,514 INFO L93 Difference]: Finished difference Result 95410 states and 132561 transitions. [2019-09-10 08:48:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:48:57,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 08:48:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:57,630 INFO L225 Difference]: With dead ends: 95410 [2019-09-10 08:48:57,630 INFO L226 Difference]: Without dead ends: 95410 [2019-09-10 08:48:57,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:48:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95410 states. [2019-09-10 08:48:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95410 to 82770. [2019-09-10 08:48:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82770 states. [2019-09-10 08:48:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82770 states to 82770 states and 114483 transitions. [2019-09-10 08:48:59,221 INFO L78 Accepts]: Start accepts. Automaton has 82770 states and 114483 transitions. Word has length 186 [2019-09-10 08:48:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:59,221 INFO L475 AbstractCegarLoop]: Abstraction has 82770 states and 114483 transitions. [2019-09-10 08:48:59,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:48:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 82770 states and 114483 transitions. [2019-09-10 08:48:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:48:59,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:59,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:59,237 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1360662285, now seen corresponding path program 1 times [2019-09-10 08:48:59,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:59,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:59,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:01,537 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 08:49:01,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:01,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:49:01,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:01,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:49:01,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:49:01,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:49:01,539 INFO L87 Difference]: Start difference. First operand 82770 states and 114483 transitions. Second operand 26 states. [2019-09-10 08:49:02,334 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:49:02,572 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:49:02,762 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:49:03,130 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:49:03,407 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 08:49:03,898 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:49:04,218 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 08:49:04,514 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:49:04,794 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:49:04,993 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:49:05,174 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 08:49:05,347 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 08:49:05,705 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-10 08:49:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:08,123 INFO L93 Difference]: Finished difference Result 81965 states and 113573 transitions. [2019-09-10 08:49:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:49:08,124 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2019-09-10 08:49:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:08,213 INFO L225 Difference]: With dead ends: 81965 [2019-09-10 08:49:08,213 INFO L226 Difference]: Without dead ends: 81965 [2019-09-10 08:49:08,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:49:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81965 states. [2019-09-10 08:49:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81965 to 81921. [2019-09-10 08:49:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81921 states. [2019-09-10 08:49:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81921 states to 81921 states and 113525 transitions. [2019-09-10 08:49:09,356 INFO L78 Accepts]: Start accepts. Automaton has 81921 states and 113525 transitions. Word has length 186 [2019-09-10 08:49:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:09,356 INFO L475 AbstractCegarLoop]: Abstraction has 81921 states and 113525 transitions. [2019-09-10 08:49:09,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:49:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 81921 states and 113525 transitions. [2019-09-10 08:49:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:09,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:09,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:09,373 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1111851491, now seen corresponding path program 1 times [2019-09-10 08:49:09,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:09,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:09,451 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 08:49:09,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:09,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:09,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:09,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:09,453 INFO L87 Difference]: Start difference. First operand 81921 states and 113525 transitions. Second operand 3 states. [2019-09-10 08:49:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:09,679 INFO L93 Difference]: Finished difference Result 81326 states and 112350 transitions. [2019-09-10 08:49:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:09,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:49:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:09,773 INFO L225 Difference]: With dead ends: 81326 [2019-09-10 08:49:09,773 INFO L226 Difference]: Without dead ends: 81326 [2019-09-10 08:49:09,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81326 states. [2019-09-10 08:49:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81326 to 81235. [2019-09-10 08:49:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81235 states. [2019-09-10 08:49:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81235 states to 81235 states and 112257 transitions. [2019-09-10 08:49:10,644 INFO L78 Accepts]: Start accepts. Automaton has 81235 states and 112257 transitions. Word has length 187 [2019-09-10 08:49:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:10,644 INFO L475 AbstractCegarLoop]: Abstraction has 81235 states and 112257 transitions. [2019-09-10 08:49:10,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 81235 states and 112257 transitions. [2019-09-10 08:49:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:10,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:10,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:10,664 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1368283012, now seen corresponding path program 1 times [2019-09-10 08:49:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:10,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:10,720 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 08:49:10,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:10,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:10,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:10,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:10,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:10,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:10,722 INFO L87 Difference]: Start difference. First operand 81235 states and 112257 transitions. Second operand 3 states. [2019-09-10 08:49:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:10,911 INFO L93 Difference]: Finished difference Result 81225 states and 111660 transitions. [2019-09-10 08:49:10,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:10,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:49:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:11,010 INFO L225 Difference]: With dead ends: 81225 [2019-09-10 08:49:11,010 INFO L226 Difference]: Without dead ends: 81225 [2019-09-10 08:49:11,011 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 08:49:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81225 states. [2019-09-10 08:49:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81225 to 81107. [2019-09-10 08:49:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81107 states. [2019-09-10 08:49:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81107 states to 81107 states and 111535 transitions. [2019-09-10 08:49:12,150 INFO L78 Accepts]: Start accepts. Automaton has 81107 states and 111535 transitions. Word has length 187 [2019-09-10 08:49:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:12,150 INFO L475 AbstractCegarLoop]: Abstraction has 81107 states and 111535 transitions. [2019-09-10 08:49:12,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 81107 states and 111535 transitions. [2019-09-10 08:49:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:12,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:12,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:12,168 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash -202404884, now seen corresponding path program 1 times [2019-09-10 08:49:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:12,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:12,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:12,223 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 08:49:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:12,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:12,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:12,225 INFO L87 Difference]: Start difference. First operand 81107 states and 111535 transitions. Second operand 3 states. [2019-09-10 08:49:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:12,426 INFO L93 Difference]: Finished difference Result 80447 states and 110189 transitions. [2019-09-10 08:49:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:12,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:49:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:12,526 INFO L225 Difference]: With dead ends: 80447 [2019-09-10 08:49:12,526 INFO L226 Difference]: Without dead ends: 80447 [2019-09-10 08:49:12,527 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 08:49:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80447 states. [2019-09-10 08:49:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80447 to 80131. [2019-09-10 08:49:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80131 states. [2019-09-10 08:49:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80131 states to 80131 states and 109860 transitions. [2019-09-10 08:49:13,306 INFO L78 Accepts]: Start accepts. Automaton has 80131 states and 109860 transitions. Word has length 187 [2019-09-10 08:49:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:13,307 INFO L475 AbstractCegarLoop]: Abstraction has 80131 states and 109860 transitions. [2019-09-10 08:49:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 80131 states and 109860 transitions. [2019-09-10 08:49:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:13,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:13,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:13,320 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1921254121, now seen corresponding path program 1 times [2019-09-10 08:49:13,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:13,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:13,377 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 08:49:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:13,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:13,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:13,379 INFO L87 Difference]: Start difference. First operand 80131 states and 109860 transitions. Second operand 3 states. [2019-09-10 08:49:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:13,574 INFO L93 Difference]: Finished difference Result 79989 states and 109193 transitions. [2019-09-10 08:49:13,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:13,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:49:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:13,661 INFO L225 Difference]: With dead ends: 79989 [2019-09-10 08:49:13,661 INFO L226 Difference]: Without dead ends: 79989 [2019-09-10 08:49:13,661 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 08:49:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79989 states. [2019-09-10 08:49:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79989 to 79964. [2019-09-10 08:49:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79964 states. [2019-09-10 08:49:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79964 states to 79964 states and 109171 transitions. [2019-09-10 08:49:14,742 INFO L78 Accepts]: Start accepts. Automaton has 79964 states and 109171 transitions. Word has length 187 [2019-09-10 08:49:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:14,743 INFO L475 AbstractCegarLoop]: Abstraction has 79964 states and 109171 transitions. [2019-09-10 08:49:14,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 79964 states and 109171 transitions. [2019-09-10 08:49:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:14,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:14,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:14,758 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1241904808, now seen corresponding path program 1 times [2019-09-10 08:49:14,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:14,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:14,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:14,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:14,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:16,280 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 08:49:16,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:16,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:49:16,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:16,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:49:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:49:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:49:16,282 INFO L87 Difference]: Start difference. First operand 79964 states and 109171 transitions. Second operand 24 states. [2019-09-10 08:49:17,079 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:49:17,287 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:49:17,452 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:49:17,683 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 08:49:17,983 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 08:49:18,246 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:49:18,504 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:49:18,680 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:49:19,020 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:49:19,184 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:49:19,325 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:49:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:22,241 INFO L93 Difference]: Finished difference Result 79500 states and 108654 transitions. [2019-09-10 08:49:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:49:22,242 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2019-09-10 08:49:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:22,340 INFO L225 Difference]: With dead ends: 79500 [2019-09-10 08:49:22,340 INFO L226 Difference]: Without dead ends: 79500 [2019-09-10 08:49:22,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=367, Invalid=1525, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:49:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79500 states. [2019-09-10 08:49:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79500 to 79500. [2019-09-10 08:49:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79500 states. [2019-09-10 08:49:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79500 states to 79500 states and 108654 transitions. [2019-09-10 08:49:23,452 INFO L78 Accepts]: Start accepts. Automaton has 79500 states and 108654 transitions. Word has length 189 [2019-09-10 08:49:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:23,452 INFO L475 AbstractCegarLoop]: Abstraction has 79500 states and 108654 transitions. [2019-09-10 08:49:23,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:49:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 79500 states and 108654 transitions. [2019-09-10 08:49:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:23,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:23,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:23,466 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash -986764872, now seen corresponding path program 1 times [2019-09-10 08:49:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:23,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:23,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:24,032 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 08:49:24,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:24,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:49:24,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:24,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:49:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:49:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:49:24,041 INFO L87 Difference]: Start difference. First operand 79500 states and 108654 transitions. Second operand 17 states. [2019-09-10 08:49:24,214 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:49:24,957 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:49:25,124 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:49:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:27,690 INFO L93 Difference]: Finished difference Result 79316 states and 108452 transitions. [2019-09-10 08:49:27,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:49:27,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 189 [2019-09-10 08:49:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:27,794 INFO L225 Difference]: With dead ends: 79316 [2019-09-10 08:49:27,795 INFO L226 Difference]: Without dead ends: 79316 [2019-09-10 08:49:27,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:49:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79316 states. [2019-09-10 08:49:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79316 to 79278. [2019-09-10 08:49:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79278 states. [2019-09-10 08:49:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79278 states to 79278 states and 108416 transitions. [2019-09-10 08:49:29,167 INFO L78 Accepts]: Start accepts. Automaton has 79278 states and 108416 transitions. Word has length 189 [2019-09-10 08:49:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:29,168 INFO L475 AbstractCegarLoop]: Abstraction has 79278 states and 108416 transitions. [2019-09-10 08:49:29,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:49:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 79278 states and 108416 transitions. [2019-09-10 08:49:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:29,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:29,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:29,182 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:29,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash 461325289, now seen corresponding path program 1 times [2019-09-10 08:49:29,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:29,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:29,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:29,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:29,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:49:29,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:29,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:49:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:49:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:49:29,837 INFO L87 Difference]: Start difference. First operand 79278 states and 108416 transitions. Second operand 19 states. [2019-09-10 08:49:30,832 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:49:31,017 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:49:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:33,306 INFO L93 Difference]: Finished difference Result 79378 states and 108525 transitions. [2019-09-10 08:49:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:49:33,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 189 [2019-09-10 08:49:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:33,389 INFO L225 Difference]: With dead ends: 79378 [2019-09-10 08:49:33,389 INFO L226 Difference]: Without dead ends: 79378 [2019-09-10 08:49:33,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:49:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79378 states. [2019-09-10 08:49:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79378 to 79062. [2019-09-10 08:49:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79062 states. [2019-09-10 08:49:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79062 states to 79062 states and 108178 transitions. [2019-09-10 08:49:34,109 INFO L78 Accepts]: Start accepts. Automaton has 79062 states and 108178 transitions. Word has length 189 [2019-09-10 08:49:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:34,109 INFO L475 AbstractCegarLoop]: Abstraction has 79062 states and 108178 transitions. [2019-09-10 08:49:34,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:49:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 79062 states and 108178 transitions. [2019-09-10 08:49:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:34,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:34,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:34,123 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash 388197216, now seen corresponding path program 1 times [2019-09-10 08:49:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:34,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:35,228 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 08:49:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 08:49:35,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:35,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 08:49:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 08:49:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:49:35,229 INFO L87 Difference]: Start difference. First operand 79062 states and 108178 transitions. Second operand 28 states. [2019-09-10 08:49:35,559 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-09-10 08:49:36,223 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 08:49:37,015 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 08:49:37,245 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 08:49:37,655 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-09-10 08:49:37,967 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-09-10 08:49:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:43,985 INFO L93 Difference]: Finished difference Result 84857 states and 115464 transitions. [2019-09-10 08:49:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 08:49:43,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 189 [2019-09-10 08:49:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:44,076 INFO L225 Difference]: With dead ends: 84857 [2019-09-10 08:49:44,076 INFO L226 Difference]: Without dead ends: 84857 [2019-09-10 08:49:44,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=628, Invalid=3532, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:49:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84857 states. [2019-09-10 08:49:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84857 to 79062. [2019-09-10 08:49:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79062 states. [2019-09-10 08:49:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79062 states to 79062 states and 108178 transitions. [2019-09-10 08:49:44,906 INFO L78 Accepts]: Start accepts. Automaton has 79062 states and 108178 transitions. Word has length 189 [2019-09-10 08:49:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:44,906 INFO L475 AbstractCegarLoop]: Abstraction has 79062 states and 108178 transitions. [2019-09-10 08:49:44,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 08:49:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 79062 states and 108178 transitions. [2019-09-10 08:49:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:44,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:44,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:44,920 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1272233428, now seen corresponding path program 1 times [2019-09-10 08:49:44,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:45,950 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 08:49:45,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:45,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:49:45,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:45,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:49:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:49:45,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:49:45,951 INFO L87 Difference]: Start difference. First operand 79062 states and 108178 transitions. Second operand 22 states. [2019-09-10 08:49:46,170 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:49:47,308 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 08:49:47,515 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 08:49:47,914 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 08:49:48,194 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 08:49:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:52,003 INFO L93 Difference]: Finished difference Result 84213 states and 114755 transitions. [2019-09-10 08:49:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:49:52,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 189 [2019-09-10 08:49:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:52,114 INFO L225 Difference]: With dead ends: 84213 [2019-09-10 08:49:52,115 INFO L226 Difference]: Without dead ends: 84213 [2019-09-10 08:49:52,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:49:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84213 states. [2019-09-10 08:49:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84213 to 78778. [2019-09-10 08:49:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78778 states. [2019-09-10 08:49:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78778 states to 78778 states and 107865 transitions. [2019-09-10 08:49:53,046 INFO L78 Accepts]: Start accepts. Automaton has 78778 states and 107865 transitions. Word has length 189 [2019-09-10 08:49:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:53,046 INFO L475 AbstractCegarLoop]: Abstraction has 78778 states and 107865 transitions. [2019-09-10 08:49:53,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:49:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 78778 states and 107865 transitions. [2019-09-10 08:49:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:53,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:53,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:53,059 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1823477088, now seen corresponding path program 1 times [2019-09-10 08:49:53,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:53,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:53,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:54,271 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 08:49:54,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:54,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:49:54,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:54,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:49:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:49:54,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:49:54,272 INFO L87 Difference]: Start difference. First operand 78778 states and 107865 transitions. Second operand 19 states. [2019-09-10 08:49:54,848 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:49:55,003 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 08:49:55,287 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 08:49:55,519 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 08:49:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:57,869 INFO L93 Difference]: Finished difference Result 78883 states and 107983 transitions. [2019-09-10 08:49:57,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:49:57,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 189 [2019-09-10 08:49:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:57,964 INFO L225 Difference]: With dead ends: 78883 [2019-09-10 08:49:57,964 INFO L226 Difference]: Without dead ends: 78883 [2019-09-10 08:49:57,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:49:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78883 states. [2019-09-10 08:49:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78883 to 78559. [2019-09-10 08:49:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78559 states. [2019-09-10 08:49:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78559 states to 78559 states and 107627 transitions. [2019-09-10 08:49:58,653 INFO L78 Accepts]: Start accepts. Automaton has 78559 states and 107627 transitions. Word has length 189 [2019-09-10 08:49:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:58,653 INFO L475 AbstractCegarLoop]: Abstraction has 78559 states and 107627 transitions. [2019-09-10 08:49:58,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:49:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 78559 states and 107627 transitions. [2019-09-10 08:49:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:49:58,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:58,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:58,665 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1906530791, now seen corresponding path program 1 times [2019-09-10 08:49:58,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:58,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:58,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:59,601 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 08:49:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:59,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:49:59,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:59,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:49:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:49:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:49:59,602 INFO L87 Difference]: Start difference. First operand 78559 states and 107627 transitions. Second operand 21 states. [2019-09-10 08:50:00,259 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 08:50:00,444 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 08:50:00,758 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-09-10 08:50:01,030 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-09-10 08:50:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:04,592 INFO L93 Difference]: Finished difference Result 80211 states and 109376 transitions. [2019-09-10 08:50:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:50:04,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 189 [2019-09-10 08:50:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:04,683 INFO L225 Difference]: With dead ends: 80211 [2019-09-10 08:50:04,683 INFO L226 Difference]: Without dead ends: 80182 [2019-09-10 08:50:04,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:50:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80182 states. [2019-09-10 08:50:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80182 to 78396. [2019-09-10 08:50:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78396 states. [2019-09-10 08:50:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78396 states to 78396 states and 107458 transitions. [2019-09-10 08:50:05,495 INFO L78 Accepts]: Start accepts. Automaton has 78396 states and 107458 transitions. Word has length 189 [2019-09-10 08:50:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:05,495 INFO L475 AbstractCegarLoop]: Abstraction has 78396 states and 107458 transitions. [2019-09-10 08:50:05,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:50:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 78396 states and 107458 transitions. [2019-09-10 08:50:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:05,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:05,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:05,508 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1621988319, now seen corresponding path program 1 times [2019-09-10 08:50:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:06,569 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 08:50:06,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:06,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:50:06,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:06,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:50:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:50:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:50:06,571 INFO L87 Difference]: Start difference. First operand 78396 states and 107458 transitions. Second operand 21 states. [2019-09-10 08:50:07,211 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:50:07,481 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 08:50:07,744 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-09-10 08:50:08,203 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-09-10 08:50:08,580 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2019-09-10 08:50:08,911 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:50:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:11,942 INFO L93 Difference]: Finished difference Result 78548 states and 107603 transitions. [2019-09-10 08:50:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:50:11,943 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 189 [2019-09-10 08:50:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:12,049 INFO L225 Difference]: With dead ends: 78548 [2019-09-10 08:50:12,049 INFO L226 Difference]: Without dead ends: 78513 [2019-09-10 08:50:12,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:50:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78513 states. [2019-09-10 08:50:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78513 to 78113. [2019-09-10 08:50:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78113 states. [2019-09-10 08:50:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78113 states to 78113 states and 107151 transitions. [2019-09-10 08:50:12,809 INFO L78 Accepts]: Start accepts. Automaton has 78113 states and 107151 transitions. Word has length 189 [2019-09-10 08:50:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:12,809 INFO L475 AbstractCegarLoop]: Abstraction has 78113 states and 107151 transitions. [2019-09-10 08:50:12,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:50:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 78113 states and 107151 transitions. [2019-09-10 08:50:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:12,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:12,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:12,823 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1784389755, now seen corresponding path program 1 times [2019-09-10 08:50:12,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:12,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:12,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:13,920 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 08:50:13,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:13,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:50:13,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:13,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:50:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:50:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:50:13,922 INFO L87 Difference]: Start difference. First operand 78113 states and 107151 transitions. Second operand 21 states. [2019-09-10 08:50:14,439 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:50:14,613 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:50:14,871 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 08:50:15,114 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 08:50:15,627 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 08:50:15,959 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:50:16,202 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:50:16,478 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:50:16,672 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:50:16,943 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:50:17,094 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:50:17,382 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:50:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:19,303 INFO L93 Difference]: Finished difference Result 77587 states and 106548 transitions. [2019-09-10 08:50:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:50:19,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 189 [2019-09-10 08:50:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:19,390 INFO L225 Difference]: With dead ends: 77587 [2019-09-10 08:50:19,390 INFO L226 Difference]: Without dead ends: 77587 [2019-09-10 08:50:19,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:50:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77587 states. [2019-09-10 08:50:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77587 to 77181. [2019-09-10 08:50:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77181 states. [2019-09-10 08:50:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77181 states to 77181 states and 106119 transitions. [2019-09-10 08:50:20,463 INFO L78 Accepts]: Start accepts. Automaton has 77181 states and 106119 transitions. Word has length 189 [2019-09-10 08:50:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:20,463 INFO L475 AbstractCegarLoop]: Abstraction has 77181 states and 106119 transitions. [2019-09-10 08:50:20,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:50:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 77181 states and 106119 transitions. [2019-09-10 08:50:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:20,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:20,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:20,475 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash -581054697, now seen corresponding path program 1 times [2019-09-10 08:50:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:20,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:20,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 08:50:20,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:50:20,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:20,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:50:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:50:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:50:20,996 INFO L87 Difference]: Start difference. First operand 77181 states and 106119 transitions. Second operand 15 states. [2019-09-10 08:50:21,654 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:50:21,800 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:50:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:23,332 INFO L93 Difference]: Finished difference Result 76972 states and 105888 transitions. [2019-09-10 08:50:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:50:23,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 189 [2019-09-10 08:50:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:23,439 INFO L225 Difference]: With dead ends: 76972 [2019-09-10 08:50:23,439 INFO L226 Difference]: Without dead ends: 76972 [2019-09-10 08:50:23,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:50:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76972 states. [2019-09-10 08:50:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76972 to 76972. [2019-09-10 08:50:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76972 states. [2019-09-10 08:50:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76972 states to 76972 states and 105888 transitions. [2019-09-10 08:50:24,269 INFO L78 Accepts]: Start accepts. Automaton has 76972 states and 105888 transitions. Word has length 189 [2019-09-10 08:50:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:24,270 INFO L475 AbstractCegarLoop]: Abstraction has 76972 states and 105888 transitions. [2019-09-10 08:50:24,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:50:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76972 states and 105888 transitions. [2019-09-10 08:50:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:24,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:24,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:24,283 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:24,283 INFO L82 PathProgramCache]: Analyzing trace with hash 943027585, now seen corresponding path program 1 times [2019-09-10 08:50:24,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:24,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:24,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:24,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:24,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:25,720 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 08:50:25,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:25,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:50:25,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:25,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:50:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:50:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:50:25,722 INFO L87 Difference]: Start difference. First operand 76972 states and 105888 transitions. Second operand 22 states. [2019-09-10 08:50:26,412 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:50:26,652 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:50:26,868 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 08:50:27,462 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 08:50:27,740 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-10 08:50:27,894 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:50:28,317 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:50:28,558 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:50:28,772 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:50:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:31,364 INFO L93 Difference]: Finished difference Result 77049 states and 105956 transitions. [2019-09-10 08:50:31,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:50:31,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 189 [2019-09-10 08:50:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:31,460 INFO L225 Difference]: With dead ends: 77049 [2019-09-10 08:50:31,460 INFO L226 Difference]: Without dead ends: 77049 [2019-09-10 08:50:31,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:50:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77049 states. [2019-09-10 08:50:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77049 to 76748. [2019-09-10 08:50:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76748 states. [2019-09-10 08:50:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76748 states to 76748 states and 105642 transitions. [2019-09-10 08:50:32,223 INFO L78 Accepts]: Start accepts. Automaton has 76748 states and 105642 transitions. Word has length 189 [2019-09-10 08:50:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:32,224 INFO L475 AbstractCegarLoop]: Abstraction has 76748 states and 105642 transitions. [2019-09-10 08:50:32,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:50:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76748 states and 105642 transitions. [2019-09-10 08:50:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:50:32,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:32,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:32,236 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1644666772, now seen corresponding path program 1 times [2019-09-10 08:50:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:32,479 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 08:50:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:50:32,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:32,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:50:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:50:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:50:32,481 INFO L87 Difference]: Start difference. First operand 76748 states and 105642 transitions. Second operand 13 states. [2019-09-10 08:50:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:34,964 INFO L93 Difference]: Finished difference Result 160018 states and 218293 transitions. [2019-09-10 08:50:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:50:34,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 191 [2019-09-10 08:50:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:35,148 INFO L225 Difference]: With dead ends: 160018 [2019-09-10 08:50:35,148 INFO L226 Difference]: Without dead ends: 160018 [2019-09-10 08:50:35,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=724, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:50:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160018 states. [2019-09-10 08:50:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160018 to 96389. [2019-09-10 08:50:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96389 states. [2019-09-10 08:50:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96389 states to 96389 states and 134599 transitions. [2019-09-10 08:50:36,417 INFO L78 Accepts]: Start accepts. Automaton has 96389 states and 134599 transitions. Word has length 191 [2019-09-10 08:50:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:36,417 INFO L475 AbstractCegarLoop]: Abstraction has 96389 states and 134599 transitions. [2019-09-10 08:50:36,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:50:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 96389 states and 134599 transitions. [2019-09-10 08:50:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:50:36,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:36,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:36,432 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1262010284, now seen corresponding path program 1 times [2019-09-10 08:50:36,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:36,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:36,635 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 08:50:36,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:36,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:50:36,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:36,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:50:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:50:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:36,638 INFO L87 Difference]: Start difference. First operand 96389 states and 134599 transitions. Second operand 8 states. [2019-09-10 08:50:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:37,732 INFO L93 Difference]: Finished difference Result 163533 states and 225377 transitions. [2019-09-10 08:50:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:37,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-10 08:50:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:37,964 INFO L225 Difference]: With dead ends: 163533 [2019-09-10 08:50:37,964 INFO L226 Difference]: Without dead ends: 163533 [2019-09-10 08:50:37,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163533 states. [2019-09-10 08:50:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163533 to 109692. [2019-09-10 08:50:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109692 states. [2019-09-10 08:50:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109692 states to 109692 states and 150245 transitions. [2019-09-10 08:50:40,070 INFO L78 Accepts]: Start accepts. Automaton has 109692 states and 150245 transitions. Word has length 191 [2019-09-10 08:50:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:40,071 INFO L475 AbstractCegarLoop]: Abstraction has 109692 states and 150245 transitions. [2019-09-10 08:50:40,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:50:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 109692 states and 150245 transitions. [2019-09-10 08:50:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:50:40,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:40,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:40,084 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash -306880562, now seen corresponding path program 1 times [2019-09-10 08:50:40,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:40,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:40,213 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 08:50:40,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:40,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:50:40,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:40,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:50:40,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:50:40,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:40,215 INFO L87 Difference]: Start difference. First operand 109692 states and 150245 transitions. Second operand 8 states. [2019-09-10 08:50:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:41,364 INFO L93 Difference]: Finished difference Result 250444 states and 346382 transitions. [2019-09-10 08:50:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:41,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-10 08:50:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:41,773 INFO L225 Difference]: With dead ends: 250444 [2019-09-10 08:50:41,773 INFO L226 Difference]: Without dead ends: 250444 [2019-09-10 08:50:41,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250444 states. [2019-09-10 08:50:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250444 to 129327. [2019-09-10 08:50:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129327 states. [2019-09-10 08:50:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129327 states to 129327 states and 179367 transitions. [2019-09-10 08:50:44,710 INFO L78 Accepts]: Start accepts. Automaton has 129327 states and 179367 transitions. Word has length 191 [2019-09-10 08:50:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:44,710 INFO L475 AbstractCegarLoop]: Abstraction has 129327 states and 179367 transitions. [2019-09-10 08:50:44,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:50:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129327 states and 179367 transitions. [2019-09-10 08:50:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:50:44,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:44,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:44,725 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1832665035, now seen corresponding path program 1 times [2019-09-10 08:50:44,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:44,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:44,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:44,836 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 08:50:44,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:44,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:50:44,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:44,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:50:44,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:50:44,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:44,837 INFO L87 Difference]: Start difference. First operand 129327 states and 179367 transitions. Second operand 8 states. [2019-09-10 08:50:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:45,959 INFO L93 Difference]: Finished difference Result 273592 states and 380929 transitions. [2019-09-10 08:50:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:45,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-10 08:50:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:46,373 INFO L225 Difference]: With dead ends: 273592 [2019-09-10 08:50:46,374 INFO L226 Difference]: Without dead ends: 273592 [2019-09-10 08:50:46,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273592 states. [2019-09-10 08:50:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273592 to 141175. [2019-09-10 08:50:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141175 states. [2019-09-10 08:50:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141175 states to 141175 states and 197935 transitions. [2019-09-10 08:50:49,364 INFO L78 Accepts]: Start accepts. Automaton has 141175 states and 197935 transitions. Word has length 191 [2019-09-10 08:50:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:49,364 INFO L475 AbstractCegarLoop]: Abstraction has 141175 states and 197935 transitions. [2019-09-10 08:50:49,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:50:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 141175 states and 197935 transitions. [2019-09-10 08:50:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:50:49,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:49,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:49,381 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720525, now seen corresponding path program 1 times [2019-09-10 08:50:49,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:49,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:49,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:49,500 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 08:50:49,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:49,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:50:49,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:49,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:50:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:50:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:49,502 INFO L87 Difference]: Start difference. First operand 141175 states and 197935 transitions. Second operand 8 states. [2019-09-10 08:50:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:51,491 INFO L93 Difference]: Finished difference Result 344112 states and 479468 transitions. [2019-09-10 08:50:51,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:51,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-10 08:50:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:52,094 INFO L225 Difference]: With dead ends: 344112 [2019-09-10 08:50:52,094 INFO L226 Difference]: Without dead ends: 344112 [2019-09-10 08:50:52,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344112 states. [2019-09-10 08:50:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344112 to 192812. [2019-09-10 08:50:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192812 states. [2019-09-10 08:50:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192812 states to 192812 states and 268724 transitions. [2019-09-10 08:50:55,996 INFO L78 Accepts]: Start accepts. Automaton has 192812 states and 268724 transitions. Word has length 191 [2019-09-10 08:50:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:55,996 INFO L475 AbstractCegarLoop]: Abstraction has 192812 states and 268724 transitions. [2019-09-10 08:50:55,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:50:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 192812 states and 268724 transitions. [2019-09-10 08:50:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:50:56,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:56,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:56,016 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash -949290968, now seen corresponding path program 1 times [2019-09-10 08:50:56,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:56,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:56,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:56,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:56,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:50:56,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:56,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:50:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:50:56,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:50:56,740 INFO L87 Difference]: Start difference. First operand 192812 states and 268724 transitions. Second operand 19 states. [2019-09-10 08:50:56,870 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:50:57,625 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:50:59,675 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 08:50:59,949 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 08:51:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:03,306 INFO L93 Difference]: Finished difference Result 196122 states and 272217 transitions. [2019-09-10 08:51:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:51:03,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2019-09-10 08:51:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:03,541 INFO L225 Difference]: With dead ends: 196122 [2019-09-10 08:51:03,541 INFO L226 Difference]: Without dead ends: 196122 [2019-09-10 08:51:03,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=378, Invalid=1262, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:51:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196122 states. [2019-09-10 08:51:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196122 to 193210. [2019-09-10 08:51:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193210 states. [2019-09-10 08:51:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193210 states to 193210 states and 269140 transitions. [2019-09-10 08:51:05,468 INFO L78 Accepts]: Start accepts. Automaton has 193210 states and 269140 transitions. Word has length 192 [2019-09-10 08:51:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:05,469 INFO L475 AbstractCegarLoop]: Abstraction has 193210 states and 269140 transitions. [2019-09-10 08:51:05,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:51:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 193210 states and 269140 transitions. [2019-09-10 08:51:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:05,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:05,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:05,486 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash -480105118, now seen corresponding path program 1 times [2019-09-10 08:51:05,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:05,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:11,240 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 25 [2019-09-10 08:51:11,711 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 08:51:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:51:11,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:11,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:51:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:51:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:51:11,713 INFO L87 Difference]: Start difference. First operand 193210 states and 269140 transitions. Second operand 26 states. [2019-09-10 08:51:12,385 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:51:12,670 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 08:51:12,912 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 08:51:13,234 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:51:13,810 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:51:14,055 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 08:51:14,454 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 08:51:14,852 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2019-09-10 08:51:15,514 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:51:15,844 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:51:16,193 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-10 08:51:16,560 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-09-10 08:51:16,968 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:51:17,373 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-09-10 08:51:17,666 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:51:17,897 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-09-10 08:51:18,295 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2019-09-10 08:51:18,726 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2019-09-10 08:51:19,040 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-10 08:51:19,540 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:51:19,827 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:51:20,312 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-10 08:51:20,673 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-09-10 08:51:21,204 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:51:21,764 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-09-10 08:51:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:23,083 INFO L93 Difference]: Finished difference Result 194374 states and 270379 transitions. [2019-09-10 08:51:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:51:23,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-09-10 08:51:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:23,740 INFO L225 Difference]: With dead ends: 194374 [2019-09-10 08:51:23,740 INFO L226 Difference]: Without dead ends: 194374 [2019-09-10 08:51:23,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=746, Invalid=2334, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:51:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194374 states. [2019-09-10 08:51:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194374 to 194284. [2019-09-10 08:51:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194284 states. [2019-09-10 08:51:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194284 states to 194284 states and 270283 transitions. [2019-09-10 08:51:25,975 INFO L78 Accepts]: Start accepts. Automaton has 194284 states and 270283 transitions. Word has length 192 [2019-09-10 08:51:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:25,976 INFO L475 AbstractCegarLoop]: Abstraction has 194284 states and 270283 transitions. [2019-09-10 08:51:25,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:51:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 194284 states and 270283 transitions. [2019-09-10 08:51:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:25,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:25,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:25,993 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:25,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1272915831, now seen corresponding path program 1 times [2019-09-10 08:51:25,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:25,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:25,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:25,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:25,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:27,987 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 08:51:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:51:27,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:27,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:51:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:51:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:51:27,988 INFO L87 Difference]: Start difference. First operand 194284 states and 270283 transitions. Second operand 26 states. [2019-09-10 08:51:29,353 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:51:29,687 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:51:30,038 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:51:30,535 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 08:51:30,996 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-09-10 08:51:31,197 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:51:31,710 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:51:31,908 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:51:32,183 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:51:32,454 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:51:32,635 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:51:33,591 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 08:51:34,119 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 08:51:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:35,834 INFO L93 Difference]: Finished difference Result 194683 states and 270657 transitions. [2019-09-10 08:51:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:51:35,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-09-10 08:51:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:36,865 INFO L225 Difference]: With dead ends: 194683 [2019-09-10 08:51:36,865 INFO L226 Difference]: Without dead ends: 194683 [2019-09-10 08:51:36,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:51:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194683 states. [2019-09-10 08:51:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194683 to 193085. [2019-09-10 08:51:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193085 states. [2019-09-10 08:51:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193085 states to 193085 states and 268991 transitions. [2019-09-10 08:51:39,532 INFO L78 Accepts]: Start accepts. Automaton has 193085 states and 268991 transitions. Word has length 192 [2019-09-10 08:51:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:39,533 INFO L475 AbstractCegarLoop]: Abstraction has 193085 states and 268991 transitions. [2019-09-10 08:51:39,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:51:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 193085 states and 268991 transitions. [2019-09-10 08:51:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:39,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:39,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:39,551 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1104966002, now seen corresponding path program 1 times [2019-09-10 08:51:39,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:39,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:39,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:40,826 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 08:51:40,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:51:40,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:40,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:51:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:51:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:51:40,827 INFO L87 Difference]: Start difference. First operand 193085 states and 268991 transitions. Second operand 22 states. [2019-09-10 08:51:41,527 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 08:51:41,699 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:51:42,206 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:51:42,463 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:51:42,650 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:51:43,205 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:51:44,021 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:51:44,338 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:51:44,642 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-09-10 08:51:45,393 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-10 08:51:45,529 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2019-09-10 08:51:45,968 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 08:51:46,235 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 08:51:46,581 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-09-10 08:51:46,748 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 08:51:47,038 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-09-10 08:51:47,208 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 08:51:47,561 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 08:51:47,877 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-09-10 08:51:48,053 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-09-10 08:51:48,404 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-10 08:51:48,724 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 08:51:49,358 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:51:49,964 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 08:51:50,196 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:51:50,348 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-10 08:51:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:52,121 INFO L93 Difference]: Finished difference Result 210313 states and 292593 transitions. [2019-09-10 08:51:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 08:51:52,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 192 [2019-09-10 08:51:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:52,467 INFO L225 Difference]: With dead ends: 210313 [2019-09-10 08:51:52,468 INFO L226 Difference]: Without dead ends: 210313 [2019-09-10 08:51:52,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=718, Invalid=2822, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:51:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210313 states. [2019-09-10 08:51:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210313 to 193617. [2019-09-10 08:51:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193617 states. [2019-09-10 08:51:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193617 states to 193617 states and 269556 transitions. [2019-09-10 08:51:55,151 INFO L78 Accepts]: Start accepts. Automaton has 193617 states and 269556 transitions. Word has length 192 [2019-09-10 08:51:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:55,151 INFO L475 AbstractCegarLoop]: Abstraction has 193617 states and 269556 transitions. [2019-09-10 08:51:55,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:51:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 193617 states and 269556 transitions. [2019-09-10 08:51:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:55,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:55,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:55,170 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1587986331, now seen corresponding path program 1 times [2019-09-10 08:51:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:55,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:55,953 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 08:51:55,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:55,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:51:55,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:55,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:51:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:51:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:51:55,955 INFO L87 Difference]: Start difference. First operand 193617 states and 269556 transitions. Second operand 20 states. [2019-09-10 08:52:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:00,891 INFO L93 Difference]: Finished difference Result 194019 states and 269966 transitions. [2019-09-10 08:52:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:52:00,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 192 [2019-09-10 08:52:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:01,146 INFO L225 Difference]: With dead ends: 194019 [2019-09-10 08:52:01,146 INFO L226 Difference]: Without dead ends: 194019 [2019-09-10 08:52:01,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:52:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194019 states. [2019-09-10 08:52:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194019 to 193566. [2019-09-10 08:52:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193566 states. [2019-09-10 08:52:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193566 states to 193566 states and 269498 transitions. [2019-09-10 08:52:03,624 INFO L78 Accepts]: Start accepts. Automaton has 193566 states and 269498 transitions. Word has length 192 [2019-09-10 08:52:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:03,624 INFO L475 AbstractCegarLoop]: Abstraction has 193566 states and 269498 transitions. [2019-09-10 08:52:03,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:52:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 193566 states and 269498 transitions. [2019-09-10 08:52:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:03,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:03,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:03,640 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:03,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1775262024, now seen corresponding path program 1 times [2019-09-10 08:52:03,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:03,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:03,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:04,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:04,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:52:04,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:04,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:52:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:52:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:52:04,729 INFO L87 Difference]: Start difference. First operand 193566 states and 269498 transitions. Second operand 23 states. [2019-09-10 08:52:05,442 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:52:06,279 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:52:06,544 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:52:06,797 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:52:07,010 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:52:07,264 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:52:07,436 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:52:07,636 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 08:52:08,505 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 08:52:08,704 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-09-10 08:52:09,218 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-09-10 08:52:09,672 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-09-10 08:52:09,947 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2019-09-10 08:52:10,250 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:52:10,823 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:52:11,535 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 08:52:11,939 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:52:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:13,313 INFO L93 Difference]: Finished difference Result 194253 states and 270231 transitions. [2019-09-10 08:52:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:52:13,313 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 192 [2019-09-10 08:52:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:13,600 INFO L225 Difference]: With dead ends: 194253 [2019-09-10 08:52:13,600 INFO L226 Difference]: Without dead ends: 194253 [2019-09-10 08:52:13,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=473, Invalid=1597, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:52:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194253 states. [2019-09-10 08:52:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194253 to 193726. [2019-09-10 08:52:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193726 states. [2019-09-10 08:52:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193726 states to 193726 states and 269667 transitions. [2019-09-10 08:52:17,603 INFO L78 Accepts]: Start accepts. Automaton has 193726 states and 269667 transitions. Word has length 192 [2019-09-10 08:52:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:17,604 INFO L475 AbstractCegarLoop]: Abstraction has 193726 states and 269667 transitions. [2019-09-10 08:52:17,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:52:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 193726 states and 269667 transitions. [2019-09-10 08:52:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:17,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:17,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:17,623 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2094570900, now seen corresponding path program 1 times [2019-09-10 08:52:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:17,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:17,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:18,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:18,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:52:18,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:18,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:52:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:52:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:52:18,146 INFO L87 Difference]: Start difference. First operand 193726 states and 269667 transitions. Second operand 18 states. [2019-09-10 08:52:23,963 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:52:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:24,662 INFO L93 Difference]: Finished difference Result 195290 states and 271295 transitions. [2019-09-10 08:52:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:52:24,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-10 08:52:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:24,935 INFO L225 Difference]: With dead ends: 195290 [2019-09-10 08:52:24,936 INFO L226 Difference]: Without dead ends: 195290 [2019-09-10 08:52:24,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=582, Invalid=2840, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:52:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195290 states. [2019-09-10 08:52:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195290 to 194104. [2019-09-10 08:52:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194104 states. [2019-09-10 08:52:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194104 states to 194104 states and 270062 transitions. [2019-09-10 08:52:27,460 INFO L78 Accepts]: Start accepts. Automaton has 194104 states and 270062 transitions. Word has length 192 [2019-09-10 08:52:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:27,461 INFO L475 AbstractCegarLoop]: Abstraction has 194104 states and 270062 transitions. [2019-09-10 08:52:27,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:52:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 194104 states and 270062 transitions. [2019-09-10 08:52:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:52:27,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:27,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:27,480 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1198581526, now seen corresponding path program 1 times [2019-09-10 08:52:27,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:27,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:27,541 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 08:52:27,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:27,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:27,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:27,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:27,542 INFO L87 Difference]: Start difference. First operand 194104 states and 270062 transitions. Second operand 4 states. [2019-09-10 08:52:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:29,095 INFO L93 Difference]: Finished difference Result 268071 states and 378028 transitions. [2019-09-10 08:52:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:52:29,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-10 08:52:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:29,526 INFO L225 Difference]: With dead ends: 268071 [2019-09-10 08:52:29,527 INFO L226 Difference]: Without dead ends: 268071 [2019-09-10 08:52:29,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268071 states. [2019-09-10 08:52:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268071 to 188914. [2019-09-10 08:52:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188914 states. [2019-09-10 08:52:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188914 states to 188914 states and 264514 transitions. [2019-09-10 08:52:32,725 INFO L78 Accepts]: Start accepts. Automaton has 188914 states and 264514 transitions. Word has length 194 [2019-09-10 08:52:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:32,726 INFO L475 AbstractCegarLoop]: Abstraction has 188914 states and 264514 transitions. [2019-09-10 08:52:32,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 188914 states and 264514 transitions. [2019-09-10 08:52:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:52:32,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:32,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:32,741 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 318313389, now seen corresponding path program 1 times [2019-09-10 08:52:32,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:32,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:32,810 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 08:52:32,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:32,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:32,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:32,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:32,812 INFO L87 Difference]: Start difference. First operand 188914 states and 264514 transitions. Second operand 3 states. [2019-09-10 08:52:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:34,443 INFO L93 Difference]: Finished difference Result 238854 states and 325959 transitions. [2019-09-10 08:52:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:34,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-10 08:52:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:34,772 INFO L225 Difference]: With dead ends: 238854 [2019-09-10 08:52:34,772 INFO L226 Difference]: Without dead ends: 238854 [2019-09-10 08:52:34,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 08:52:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238854 states. [2019-09-10 08:52:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238854 to 194780. [2019-09-10 08:52:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194780 states. [2019-09-10 08:52:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194780 states to 194780 states and 265146 transitions. [2019-09-10 08:52:37,727 INFO L78 Accepts]: Start accepts. Automaton has 194780 states and 265146 transitions. Word has length 194 [2019-09-10 08:52:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:37,728 INFO L475 AbstractCegarLoop]: Abstraction has 194780 states and 265146 transitions. [2019-09-10 08:52:37,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194780 states and 265146 transitions. [2019-09-10 08:52:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:52:37,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:37,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:37,743 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 119666035, now seen corresponding path program 1 times [2019-09-10 08:52:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:37,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:38,547 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 08:52:38,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:38,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:52:38,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:38,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:52:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:52:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:52:38,548 INFO L87 Difference]: Start difference. First operand 194780 states and 265146 transitions. Second operand 26 states. [2019-09-10 08:52:38,725 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 08:52:39,791 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:52:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:46,178 INFO L93 Difference]: Finished difference Result 287611 states and 392964 transitions. [2019-09-10 08:52:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:52:46,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 194 [2019-09-10 08:52:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:46,600 INFO L225 Difference]: With dead ends: 287611 [2019-09-10 08:52:46,600 INFO L226 Difference]: Without dead ends: 287611 [2019-09-10 08:52:46,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=476, Invalid=2494, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 08:52:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287611 states. [2019-09-10 08:52:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287611 to 195967. [2019-09-10 08:52:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195967 states. [2019-09-10 08:52:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195967 states to 195967 states and 266349 transitions. [2019-09-10 08:52:50,937 INFO L78 Accepts]: Start accepts. Automaton has 195967 states and 266349 transitions. Word has length 194 [2019-09-10 08:52:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:50,937 INFO L475 AbstractCegarLoop]: Abstraction has 195967 states and 266349 transitions. [2019-09-10 08:52:50,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:52:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 195967 states and 266349 transitions. [2019-09-10 08:52:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:52:50,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:50,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:50,953 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1355473329, now seen corresponding path program 1 times [2019-09-10 08:52:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:50,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:50,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:51,009 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 08:52:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:51,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:51,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:51,010 INFO L87 Difference]: Start difference. First operand 195967 states and 266349 transitions. Second operand 4 states. [2019-09-10 08:52:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:51,659 INFO L93 Difference]: Finished difference Result 277887 states and 381807 transitions. [2019-09-10 08:52:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:52:51,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-10 08:52:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:52,063 INFO L225 Difference]: With dead ends: 277887 [2019-09-10 08:52:52,063 INFO L226 Difference]: Without dead ends: 277887 [2019-09-10 08:52:52,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277887 states. [2019-09-10 08:52:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277887 to 191439. [2019-09-10 08:52:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191439 states. [2019-09-10 08:52:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191439 states to 191439 states and 261542 transitions. [2019-09-10 08:52:56,382 INFO L78 Accepts]: Start accepts. Automaton has 191439 states and 261542 transitions. Word has length 194 [2019-09-10 08:52:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:56,382 INFO L475 AbstractCegarLoop]: Abstraction has 191439 states and 261542 transitions. [2019-09-10 08:52:56,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 191439 states and 261542 transitions. [2019-09-10 08:52:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:52:56,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:56,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:56,394 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash -305538500, now seen corresponding path program 1 times [2019-09-10 08:52:56,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:56,904 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 08:52:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:52:56,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:56,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:52:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:52:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:52:56,906 INFO L87 Difference]: Start difference. First operand 191439 states and 261542 transitions. Second operand 21 states. [2019-09-10 08:53:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:03,455 INFO L93 Difference]: Finished difference Result 361871 states and 497936 transitions. [2019-09-10 08:53:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:53:03,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:53:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:03,999 INFO L225 Difference]: With dead ends: 361871 [2019-09-10 08:53:04,000 INFO L226 Difference]: Without dead ends: 361871 [2019-09-10 08:53:04,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=405, Invalid=1487, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:53:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361871 states. [2019-09-10 08:53:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361871 to 192391. [2019-09-10 08:53:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192391 states. [2019-09-10 08:53:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192391 states to 192391 states and 262520 transitions. [2019-09-10 08:53:12,017 INFO L78 Accepts]: Start accepts. Automaton has 192391 states and 262520 transitions. Word has length 194 [2019-09-10 08:53:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:12,017 INFO L475 AbstractCegarLoop]: Abstraction has 192391 states and 262520 transitions. [2019-09-10 08:53:12,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 192391 states and 262520 transitions. [2019-09-10 08:53:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:53:12,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:12,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:12,029 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1293432309, now seen corresponding path program 1 times [2019-09-10 08:53:12,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:12,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:12,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:12,087 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 08:53:12,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:12,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:12,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:12,088 INFO L87 Difference]: Start difference. First operand 192391 states and 262520 transitions. Second operand 4 states. [2019-09-10 08:53:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:12,687 INFO L93 Difference]: Finished difference Result 254464 states and 349615 transitions. [2019-09-10 08:53:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:53:12,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-10 08:53:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:13,072 INFO L225 Difference]: With dead ends: 254464 [2019-09-10 08:53:13,072 INFO L226 Difference]: Without dead ends: 254464 [2019-09-10 08:53:13,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254464 states. [2019-09-10 08:53:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254464 to 190748. [2019-09-10 08:53:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190748 states. [2019-09-10 08:53:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190748 states to 190748 states and 260693 transitions. [2019-09-10 08:53:19,196 INFO L78 Accepts]: Start accepts. Automaton has 190748 states and 260693 transitions. Word has length 194 [2019-09-10 08:53:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:19,197 INFO L475 AbstractCegarLoop]: Abstraction has 190748 states and 260693 transitions. [2019-09-10 08:53:19,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 190748 states and 260693 transitions. [2019-09-10 08:53:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:53:19,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:19,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:19,207 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1256290216, now seen corresponding path program 1 times [2019-09-10 08:53:19,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:19,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:19,643 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 08:53:19,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:19,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:19,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:19,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:19,645 INFO L87 Difference]: Start difference. First operand 190748 states and 260693 transitions. Second operand 21 states. [2019-09-10 08:53:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:25,705 INFO L93 Difference]: Finished difference Result 376307 states and 517063 transitions. [2019-09-10 08:53:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:53:25,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:53:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:27,112 INFO L225 Difference]: With dead ends: 376307 [2019-09-10 08:53:27,112 INFO L226 Difference]: Without dead ends: 376307 [2019-09-10 08:53:27,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=443, Invalid=1627, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:53:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376307 states. [2019-09-10 08:53:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376307 to 191648. [2019-09-10 08:53:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191648 states. [2019-09-10 08:53:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191648 states to 191648 states and 261622 transitions. [2019-09-10 08:53:33,342 INFO L78 Accepts]: Start accepts. Automaton has 191648 states and 261622 transitions. Word has length 194 [2019-09-10 08:53:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:33,343 INFO L475 AbstractCegarLoop]: Abstraction has 191648 states and 261622 transitions. [2019-09-10 08:53:33,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 191648 states and 261622 transitions. [2019-09-10 08:53:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:53:33,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:33,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:33,359 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash -207765126, now seen corresponding path program 1 times [2019-09-10 08:53:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:34,401 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 08:53:34,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:34,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:34,403 INFO L87 Difference]: Start difference. First operand 191648 states and 261622 transitions. Second operand 21 states. [2019-09-10 08:53:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:40,256 INFO L93 Difference]: Finished difference Result 371112 states and 507582 transitions. [2019-09-10 08:53:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:53:40,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:53:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:40,837 INFO L225 Difference]: With dead ends: 371112 [2019-09-10 08:53:40,837 INFO L226 Difference]: Without dead ends: 371112 [2019-09-10 08:53:40,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=405, Invalid=1487, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:53:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371112 states. [2019-09-10 08:53:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371112 to 192667. [2019-09-10 08:53:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192667 states. [2019-09-10 08:53:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192667 states to 192667 states and 262671 transitions. [2019-09-10 08:53:47,064 INFO L78 Accepts]: Start accepts. Automaton has 192667 states and 262671 transitions. Word has length 194 [2019-09-10 08:53:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:47,064 INFO L475 AbstractCegarLoop]: Abstraction has 192667 states and 262671 transitions. [2019-09-10 08:53:47,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 192667 states and 262671 transitions. [2019-09-10 08:53:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:53:47,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:47,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:47,078 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1488355980, now seen corresponding path program 1 times [2019-09-10 08:53:47,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:48,143 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 08:53:48,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:48,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:48,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:48,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:48,145 INFO L87 Difference]: Start difference. First operand 192667 states and 262671 transitions. Second operand 21 states. [2019-09-10 08:53:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:55,696 INFO L93 Difference]: Finished difference Result 383621 states and 526121 transitions. [2019-09-10 08:53:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:53:55,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:53:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:56,332 INFO L225 Difference]: With dead ends: 383621 [2019-09-10 08:53:56,333 INFO L226 Difference]: Without dead ends: 383453 [2019-09-10 08:53:56,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:53:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383453 states. [2019-09-10 08:53:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383453 to 193442. [2019-09-10 08:53:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193442 states. [2019-09-10 08:53:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193442 states to 193442 states and 263474 transitions. [2019-09-10 08:53:59,691 INFO L78 Accepts]: Start accepts. Automaton has 193442 states and 263474 transitions. Word has length 194 [2019-09-10 08:53:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:59,691 INFO L475 AbstractCegarLoop]: Abstraction has 193442 states and 263474 transitions. [2019-09-10 08:53:59,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 193442 states and 263474 transitions. [2019-09-10 08:53:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:53:59,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:59,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:59,703 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 804824104, now seen corresponding path program 1 times [2019-09-10 08:53:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:59,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:01,067 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 08:54:01,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:54:01,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:01,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:54:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:54:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:54:01,069 INFO L87 Difference]: Start difference. First operand 193442 states and 263474 transitions. Second operand 21 states. [2019-09-10 08:54:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:06,549 INFO L93 Difference]: Finished difference Result 337800 states and 463771 transitions. [2019-09-10 08:54:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:54:06,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:54:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:07,884 INFO L225 Difference]: With dead ends: 337800 [2019-09-10 08:54:07,885 INFO L226 Difference]: Without dead ends: 337656 [2019-09-10 08:54:07,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=1485, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:54:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337656 states. [2019-09-10 08:54:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337656 to 194157. [2019-09-10 08:54:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194157 states. [2019-09-10 08:54:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194157 states to 194157 states and 264200 transitions. [2019-09-10 08:54:14,047 INFO L78 Accepts]: Start accepts. Automaton has 194157 states and 264200 transitions. Word has length 194 [2019-09-10 08:54:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:14,048 INFO L475 AbstractCegarLoop]: Abstraction has 194157 states and 264200 transitions. [2019-09-10 08:54:14,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:54:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 194157 states and 264200 transitions. [2019-09-10 08:54:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:14,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:14,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:14,060 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash 115414766, now seen corresponding path program 1 times [2019-09-10 08:54:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:14,147 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 08:54:14,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:14,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:14,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:14,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:14,148 INFO L87 Difference]: Start difference. First operand 194157 states and 264200 transitions. Second operand 6 states. [2019-09-10 08:54:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:15,539 INFO L93 Difference]: Finished difference Result 288115 states and 395182 transitions. [2019-09-10 08:54:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:15,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-10 08:54:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:15,936 INFO L225 Difference]: With dead ends: 288115 [2019-09-10 08:54:15,936 INFO L226 Difference]: Without dead ends: 288115 [2019-09-10 08:54:15,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288115 states. [2019-09-10 08:54:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288115 to 194211. [2019-09-10 08:54:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194211 states. [2019-09-10 08:54:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194211 states to 194211 states and 264254 transitions. [2019-09-10 08:54:18,943 INFO L78 Accepts]: Start accepts. Automaton has 194211 states and 264254 transitions. Word has length 195 [2019-09-10 08:54:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:18,943 INFO L475 AbstractCegarLoop]: Abstraction has 194211 states and 264254 transitions. [2019-09-10 08:54:18,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 194211 states and 264254 transitions. [2019-09-10 08:54:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:18,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:18,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:18,955 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 117261808, now seen corresponding path program 1 times [2019-09-10 08:54:18,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:18,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:19,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:19,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:19,079 INFO L87 Difference]: Start difference. First operand 194211 states and 264254 transitions. Second operand 5 states. [2019-09-10 08:54:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:22,760 INFO L93 Difference]: Finished difference Result 236723 states and 320925 transitions. [2019-09-10 08:54:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:22,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-10 08:54:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:23,056 INFO L225 Difference]: With dead ends: 236723 [2019-09-10 08:54:23,056 INFO L226 Difference]: Without dead ends: 236723 [2019-09-10 08:54:23,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236723 states. [2019-09-10 08:54:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236723 to 236400. [2019-09-10 08:54:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236400 states. [2019-09-10 08:54:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236400 states to 236400 states and 320603 transitions. [2019-09-10 08:54:25,154 INFO L78 Accepts]: Start accepts. Automaton has 236400 states and 320603 transitions. Word has length 195 [2019-09-10 08:54:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:25,155 INFO L475 AbstractCegarLoop]: Abstraction has 236400 states and 320603 transitions. [2019-09-10 08:54:25,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 236400 states and 320603 transitions. [2019-09-10 08:54:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:25,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:25,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:25,166 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1684642481, now seen corresponding path program 1 times [2019-09-10 08:54:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:25,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:25,247 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 08:54:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:25,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:25,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:25,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:25,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:25,248 INFO L87 Difference]: Start difference. First operand 236400 states and 320603 transitions. Second operand 6 states. [2019-09-10 08:54:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:26,008 INFO L93 Difference]: Finished difference Result 330358 states and 451585 transitions. [2019-09-10 08:54:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:26,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-10 08:54:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:27,587 INFO L225 Difference]: With dead ends: 330358 [2019-09-10 08:54:27,587 INFO L226 Difference]: Without dead ends: 330358 [2019-09-10 08:54:27,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330358 states. [2019-09-10 08:54:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330358 to 236454. [2019-09-10 08:54:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236454 states. [2019-09-10 08:54:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236454 states to 236454 states and 320657 transitions. [2019-09-10 08:54:34,586 INFO L78 Accepts]: Start accepts. Automaton has 236454 states and 320657 transitions. Word has length 195 [2019-09-10 08:54:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:34,587 INFO L475 AbstractCegarLoop]: Abstraction has 236454 states and 320657 transitions. [2019-09-10 08:54:34,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 236454 states and 320657 transitions. [2019-09-10 08:54:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:34,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:34,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:34,599 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1686489523, now seen corresponding path program 1 times [2019-09-10 08:54:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:34,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:34,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:34,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:34,704 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 08:54:34,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:34,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:34,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:34,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:34,705 INFO L87 Difference]: Start difference. First operand 236454 states and 320657 transitions. Second operand 5 states. [2019-09-10 08:54:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:36,125 INFO L93 Difference]: Finished difference Result 279287 states and 377649 transitions. [2019-09-10 08:54:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:36,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-10 08:54:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:36,480 INFO L225 Difference]: With dead ends: 279287 [2019-09-10 08:54:36,480 INFO L226 Difference]: Without dead ends: 279287 [2019-09-10 08:54:36,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279287 states. [2019-09-10 08:54:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279287 to 279072. [2019-09-10 08:54:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279072 states. [2019-09-10 08:54:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279072 states to 279072 states and 377435 transitions. [2019-09-10 08:54:45,489 INFO L78 Accepts]: Start accepts. Automaton has 279072 states and 377435 transitions. Word has length 195 [2019-09-10 08:54:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:45,490 INFO L475 AbstractCegarLoop]: Abstraction has 279072 states and 377435 transitions. [2019-09-10 08:54:45,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 279072 states and 377435 transitions. [2019-09-10 08:54:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:45,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:45,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:45,502 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1025476663, now seen corresponding path program 1 times [2019-09-10 08:54:45,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:45,607 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 08:54:45,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:45,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:45,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:45,609 INFO L87 Difference]: Start difference. First operand 279072 states and 377435 transitions. Second operand 6 states. [2019-09-10 08:54:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:46,447 INFO L93 Difference]: Finished difference Result 373030 states and 508417 transitions. [2019-09-10 08:54:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:46,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-10 08:54:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:47,006 INFO L225 Difference]: With dead ends: 373030 [2019-09-10 08:54:47,006 INFO L226 Difference]: Without dead ends: 373030 [2019-09-10 08:54:47,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373030 states. [2019-09-10 08:54:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373030 to 279126. [2019-09-10 08:54:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279126 states. [2019-09-10 08:54:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279126 states to 279126 states and 377489 transitions. [2019-09-10 08:54:51,316 INFO L78 Accepts]: Start accepts. Automaton has 279126 states and 377489 transitions. Word has length 195 [2019-09-10 08:54:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:51,317 INFO L475 AbstractCegarLoop]: Abstraction has 279126 states and 377489 transitions. [2019-09-10 08:54:51,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 279126 states and 377489 transitions. [2019-09-10 08:54:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:51,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:51,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:51,329 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1027323705, now seen corresponding path program 1 times [2019-09-10 08:54:51,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:51,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:51,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:51,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:51,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:51,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:51,456 INFO L87 Difference]: Start difference. First operand 279126 states and 377489 transitions. Second operand 5 states. [2019-09-10 08:54:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:53,335 INFO L93 Difference]: Finished difference Result 321959 states and 434481 transitions. [2019-09-10 08:54:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:53,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-10 08:54:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:53,801 INFO L225 Difference]: With dead ends: 321959 [2019-09-10 08:54:53,802 INFO L226 Difference]: Without dead ends: 321959 [2019-09-10 08:54:53,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321959 states. [2019-09-10 08:55:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321959 to 321603. [2019-09-10 08:55:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321603 states. [2019-09-10 08:55:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321603 states to 321603 states and 434126 transitions. [2019-09-10 08:55:02,377 INFO L78 Accepts]: Start accepts. Automaton has 321603 states and 434126 transitions. Word has length 195 [2019-09-10 08:55:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:02,377 INFO L475 AbstractCegarLoop]: Abstraction has 321603 states and 434126 transitions. [2019-09-10 08:55:02,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:55:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 321603 states and 434126 transitions. [2019-09-10 08:55:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:55:02,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:02,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:02,391 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 429468748, now seen corresponding path program 1 times [2019-09-10 08:55:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:02,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:02,456 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 08:55:02,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:02,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:02,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:02,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:02,458 INFO L87 Difference]: Start difference. First operand 321603 states and 434126 transitions. Second operand 3 states. [2019-09-10 08:55:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:03,187 INFO L93 Difference]: Finished difference Result 319219 states and 429635 transitions. [2019-09-10 08:55:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:03,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 08:55:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:03,583 INFO L225 Difference]: With dead ends: 319219 [2019-09-10 08:55:03,583 INFO L226 Difference]: Without dead ends: 319219 [2019-09-10 08:55:03,583 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 08:55:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319219 states. [2019-09-10 08:55:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319219 to 319135. [2019-09-10 08:55:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319135 states. [2019-09-10 08:55:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319135 states to 319135 states and 429552 transitions. [2019-09-10 08:55:12,852 INFO L78 Accepts]: Start accepts. Automaton has 319135 states and 429552 transitions. Word has length 196 [2019-09-10 08:55:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:12,852 INFO L475 AbstractCegarLoop]: Abstraction has 319135 states and 429552 transitions. [2019-09-10 08:55:12,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 319135 states and 429552 transitions. [2019-09-10 08:55:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:55:12,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:12,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:12,863 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1613025790, now seen corresponding path program 1 times [2019-09-10 08:55:12,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:12,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:12,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:12,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:12,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:12,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:12,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:12,927 INFO L87 Difference]: Start difference. First operand 319135 states and 429552 transitions. Second operand 3 states. [2019-09-10 08:55:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:14,661 INFO L93 Difference]: Finished difference Result 317967 states and 426247 transitions. [2019-09-10 08:55:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:14,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 08:55:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:15,164 INFO L225 Difference]: With dead ends: 317967 [2019-09-10 08:55:15,165 INFO L226 Difference]: Without dead ends: 317967 [2019-09-10 08:55:15,165 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 08:55:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317967 states. [2019-09-10 08:55:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317967 to 317965. [2019-09-10 08:55:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317965 states. [2019-09-10 08:55:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317965 states to 317965 states and 426246 transitions. [2019-09-10 08:55:25,534 INFO L78 Accepts]: Start accepts. Automaton has 317965 states and 426246 transitions. Word has length 196 [2019-09-10 08:55:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:25,535 INFO L475 AbstractCegarLoop]: Abstraction has 317965 states and 426246 transitions. [2019-09-10 08:55:25,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 317965 states and 426246 transitions. [2019-09-10 08:55:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:55:25,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:25,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:25,547 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1272280754, now seen corresponding path program 1 times [2019-09-10 08:55:25,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:25,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:25,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:25,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:25,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:25,975 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 08:55:25,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:25,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:55:25,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:25,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:55:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:55:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:55:25,977 INFO L87 Difference]: Start difference. First operand 317965 states and 426246 transitions. Second operand 20 states. [2019-09-10 08:55:26,878 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:55:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:30,388 INFO L93 Difference]: Finished difference Result 316820 states and 425071 transitions. [2019-09-10 08:55:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:55:30,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 197 [2019-09-10 08:55:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:30,784 INFO L225 Difference]: With dead ends: 316820 [2019-09-10 08:55:30,784 INFO L226 Difference]: Without dead ends: 316820 [2019-09-10 08:55:30,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:55:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316820 states. [2019-09-10 08:55:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316820 to 316632. [2019-09-10 08:55:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316632 states. [2019-09-10 08:55:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316632 states to 316632 states and 424881 transitions. [2019-09-10 08:55:35,388 INFO L78 Accepts]: Start accepts. Automaton has 316632 states and 424881 transitions. Word has length 197 [2019-09-10 08:55:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:35,388 INFO L475 AbstractCegarLoop]: Abstraction has 316632 states and 424881 transitions. [2019-09-10 08:55:35,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:55:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 316632 states and 424881 transitions. [2019-09-10 08:55:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:55:35,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:35,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:35,398 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1992947941, now seen corresponding path program 1 times [2019-09-10 08:55:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:35,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:35,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:35,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:35,740 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 08:55:35,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:35,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:55:35,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:35,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:55:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:55:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:55:35,741 INFO L87 Difference]: Start difference. First operand 316632 states and 424881 transitions. Second operand 20 states. [2019-09-10 08:55:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:40,481 INFO L93 Difference]: Finished difference Result 316242 states and 424480 transitions. [2019-09-10 08:55:40,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:55:40,482 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 197 [2019-09-10 08:55:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:40,907 INFO L225 Difference]: With dead ends: 316242 [2019-09-10 08:55:40,907 INFO L226 Difference]: Without dead ends: 316228 [2019-09-10 08:55:40,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:55:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316228 states. [2019-09-10 08:55:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316228 to 315776. [2019-09-10 08:55:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315776 states. [2019-09-10 08:55:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315776 states to 315776 states and 424002 transitions. [2019-09-10 08:55:45,656 INFO L78 Accepts]: Start accepts. Automaton has 315776 states and 424002 transitions. Word has length 197 [2019-09-10 08:55:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:45,656 INFO L475 AbstractCegarLoop]: Abstraction has 315776 states and 424002 transitions. [2019-09-10 08:55:45,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:55:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 315776 states and 424002 transitions. [2019-09-10 08:55:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:55:45,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:45,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:45,667 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:45,667 INFO L82 PathProgramCache]: Analyzing trace with hash 447761066, now seen corresponding path program 1 times [2019-09-10 08:55:45,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:45,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:45,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:45,952 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 08:55:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:45,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:55:45,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:45,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:55:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:55:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:55:45,953 INFO L87 Difference]: Start difference. First operand 315776 states and 424002 transitions. Second operand 16 states. [2019-09-10 08:55:47,536 WARN L188 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-10 08:55:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:50,807 INFO L93 Difference]: Finished difference Result 472251 states and 634485 transitions. [2019-09-10 08:55:50,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:55:50,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 199 [2019-09-10 08:55:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:56,836 INFO L225 Difference]: With dead ends: 472251 [2019-09-10 08:55:56,837 INFO L226 Difference]: Without dead ends: 472251 [2019-09-10 08:55:56,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=393, Invalid=1167, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:55:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472251 states. [2019-09-10 08:56:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472251 to 316403. [2019-09-10 08:56:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316403 states. [2019-09-10 08:56:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316403 states to 316403 states and 424635 transitions. [2019-09-10 08:56:00,704 INFO L78 Accepts]: Start accepts. Automaton has 316403 states and 424635 transitions. Word has length 199 [2019-09-10 08:56:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:00,705 INFO L475 AbstractCegarLoop]: Abstraction has 316403 states and 424635 transitions. [2019-09-10 08:56:00,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:56:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 316403 states and 424635 transitions. [2019-09-10 08:56:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:56:00,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:00,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:00,715 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:00,715 INFO L82 PathProgramCache]: Analyzing trace with hash 304586800, now seen corresponding path program 1 times [2019-09-10 08:56:00,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:00,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:00,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:01,864 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 08:56:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:01,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:56:01,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:01,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:56:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:56:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:56:01,865 INFO L87 Difference]: Start difference. First operand 316403 states and 424635 transitions. Second operand 15 states. [2019-09-10 08:56:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:05,599 INFO L93 Difference]: Finished difference Result 521281 states and 702951 transitions. [2019-09-10 08:56:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:56:05,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 199 [2019-09-10 08:56:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:07,854 INFO L225 Difference]: With dead ends: 521281 [2019-09-10 08:56:07,854 INFO L226 Difference]: Without dead ends: 521281 [2019-09-10 08:56:07,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:56:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521281 states. [2019-09-10 08:56:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521281 to 316455. [2019-09-10 08:56:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316455 states. [2019-09-10 08:56:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316455 states to 316455 states and 424651 transitions. [2019-09-10 08:56:14,291 INFO L78 Accepts]: Start accepts. Automaton has 316455 states and 424651 transitions. Word has length 199 [2019-09-10 08:56:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:14,292 INFO L475 AbstractCegarLoop]: Abstraction has 316455 states and 424651 transitions. [2019-09-10 08:56:14,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:56:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 316455 states and 424651 transitions. [2019-09-10 08:56:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:56:14,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:14,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:14,302 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash -780790661, now seen corresponding path program 1 times [2019-09-10 08:56:14,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:14,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:14,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:14,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:56:14,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:14,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:56:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:56:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:56:14,599 INFO L87 Difference]: Start difference. First operand 316455 states and 424651 transitions. Second operand 15 states. [2019-09-10 08:56:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:22,922 INFO L93 Difference]: Finished difference Result 551151 states and 742501 transitions. [2019-09-10 08:56:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:56:22,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 199 [2019-09-10 08:56:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.