java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:01:04,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:01:04,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:01:04,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:01:04,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:01:04,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:01:04,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:01:04,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:01:04,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:01:04,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:01:04,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:01:04,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:01:04,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:01:04,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:01:04,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:01:04,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:01:04,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:01:04,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:01:04,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:01:04,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:01:04,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:01:04,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:01:04,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:01:04,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:01:04,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:01:04,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:01:04,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:01:04,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:01:04,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:01:04,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:01:04,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:01:04,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:01:04,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:01:04,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:01:04,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:01:04,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:01:04,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:01:04,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:01:04,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:01:04,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:01:04,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:01:04,641 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 07:01:04,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:01:04,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:01:04,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:01:04,668 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:01:04,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:01:04,668 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:01:04,669 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:01:04,669 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:01:04,669 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:01:04,669 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:01:04,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:01:04,670 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:01:04,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:01:04,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:01:04,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:01:04,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:01:04,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:01:04,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:01:04,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:01:04,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:01:04,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:01:04,672 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:01:04,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:01:04,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:01:04,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:01:04,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:01:04,673 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:01:04,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:01:04,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:01:04,674 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:01:04,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:01:04,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:01:04,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:01:04,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:01:04,716 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:01:04,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:01:04,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89446beed/64b5a6fe0cd24c1dbb68f257f3a4684b/FLAGcd0671615 [2019-09-10 07:01:05,688 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:01:05,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:01:05,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89446beed/64b5a6fe0cd24c1dbb68f257f3a4684b/FLAGcd0671615 [2019-09-10 07:01:06,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89446beed/64b5a6fe0cd24c1dbb68f257f3a4684b [2019-09-10 07:01:06,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:01:06,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:01:06,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:06,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:01:06,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:01:06,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:06" (1/1) ... [2019-09-10 07:01:06,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682bde13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:06, skipping insertion in model container [2019-09-10 07:01:06,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:06" (1/1) ... [2019-09-10 07:01:06,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:01:06,491 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:01:08,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:08,483 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:01:09,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:09,500 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:01:09,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09 WrapperNode [2019-09-10 07:01:09,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:09,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:01:09,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:01:09,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:01:09,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (1/1) ... [2019-09-10 07:01:09,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:01:09,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:01:09,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:01:09,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:01:09,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (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 07:01:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:01:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:01:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:01:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:01:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:01:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:01:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:01:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:01:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:01:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:01:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:01:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:01:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:01:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:01:18,861 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:01:18,861 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:01:18,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:18 BoogieIcfgContainer [2019-09-10 07:01:18,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:01:18,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:01:18,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:01:18,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:01:18,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:01:06" (1/3) ... [2019-09-10 07:01:18,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e6eba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:18, skipping insertion in model container [2019-09-10 07:01:18,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:09" (2/3) ... [2019-09-10 07:01:18,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e6eba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:18, skipping insertion in model container [2019-09-10 07:01:18,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:18" (3/3) ... [2019-09-10 07:01:18,886 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:01:18,901 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:01:18,934 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-10 07:01:18,959 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-10 07:01:18,994 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:01:18,994 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:01:18,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:01:18,995 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:01:18,995 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:01:18,995 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:01:18,995 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:01:18,996 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:01:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states. [2019-09-10 07:01:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:01:19,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:19,124 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] [2019-09-10 07:01:19,128 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash 659156996, now seen corresponding path program 1 times [2019-09-10 07:01:19,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:20,175 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 07:01:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:20,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:20,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:20,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:20,206 INFO L87 Difference]: Start difference. First operand 3737 states. Second operand 5 states. [2019-09-10 07:01:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:25,765 INFO L93 Difference]: Finished difference Result 4518 states and 7685 transitions. [2019-09-10 07:01:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:25,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 07:01:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:25,808 INFO L225 Difference]: With dead ends: 4518 [2019-09-10 07:01:25,809 INFO L226 Difference]: Without dead ends: 4506 [2019-09-10 07:01:25,811 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 07:01:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2019-09-10 07:01:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4481. [2019-09-10 07:01:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2019-09-10 07:01:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 5810 transitions. [2019-09-10 07:01:26,018 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 5810 transitions. Word has length 69 [2019-09-10 07:01:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:26,019 INFO L475 AbstractCegarLoop]: Abstraction has 4481 states and 5810 transitions. [2019-09-10 07:01:26,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 5810 transitions. [2019-09-10 07:01:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:01:26,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:26,030 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] [2019-09-10 07:01:26,031 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1884466580, now seen corresponding path program 1 times [2019-09-10 07:01:26,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:26,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:26,313 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 07:01:26,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:26,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:26,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:26,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:26,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:26,317 INFO L87 Difference]: Start difference. First operand 4481 states and 5810 transitions. Second operand 6 states. [2019-09-10 07:01:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:29,467 INFO L93 Difference]: Finished difference Result 5950 states and 7746 transitions. [2019-09-10 07:01:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:29,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:01:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:29,496 INFO L225 Difference]: With dead ends: 5950 [2019-09-10 07:01:29,496 INFO L226 Difference]: Without dead ends: 5950 [2019-09-10 07:01:29,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2019-09-10 07:01:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5918. [2019-09-10 07:01:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-09-10 07:01:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 7728 transitions. [2019-09-10 07:01:29,646 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 7728 transitions. Word has length 70 [2019-09-10 07:01:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:29,647 INFO L475 AbstractCegarLoop]: Abstraction has 5918 states and 7728 transitions. [2019-09-10 07:01:29,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 7728 transitions. [2019-09-10 07:01:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:01:29,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:29,661 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] [2019-09-10 07:01:29,662 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 353186205, now seen corresponding path program 1 times [2019-09-10 07:01:29,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:29,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:29,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:29,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:30,035 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 07:01:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:30,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:30,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:30,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:30,037 INFO L87 Difference]: Start difference. First operand 5918 states and 7728 transitions. Second operand 6 states. [2019-09-10 07:01:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:32,847 INFO L93 Difference]: Finished difference Result 9756 states and 12772 transitions. [2019-09-10 07:01:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:32,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:01:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:32,892 INFO L225 Difference]: With dead ends: 9756 [2019-09-10 07:01:32,892 INFO L226 Difference]: Without dead ends: 9756 [2019-09-10 07:01:32,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2019-09-10 07:01:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 9711. [2019-09-10 07:01:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9711 states. [2019-09-10 07:01:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 12741 transitions. [2019-09-10 07:01:33,098 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 12741 transitions. Word has length 70 [2019-09-10 07:01:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:33,099 INFO L475 AbstractCegarLoop]: Abstraction has 9711 states and 12741 transitions. [2019-09-10 07:01:33,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 12741 transitions. [2019-09-10 07:01:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:01:33,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:33,112 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] [2019-09-10 07:01:33,114 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1292285136, now seen corresponding path program 1 times [2019-09-10 07:01:33,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:33,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:33,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:33,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:33,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:33,425 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 07:01:33,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:33,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:33,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:33,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:33,427 INFO L87 Difference]: Start difference. First operand 9711 states and 12741 transitions. Second operand 6 states. [2019-09-10 07:01:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:35,860 INFO L93 Difference]: Finished difference Result 16110 states and 21502 transitions. [2019-09-10 07:01:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:35,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 07:01:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:35,915 INFO L225 Difference]: With dead ends: 16110 [2019-09-10 07:01:35,916 INFO L226 Difference]: Without dead ends: 16110 [2019-09-10 07:01:35,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16110 states. [2019-09-10 07:01:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16110 to 16060. [2019-09-10 07:01:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16060 states. [2019-09-10 07:01:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16060 states to 16060 states and 21465 transitions. [2019-09-10 07:01:36,175 INFO L78 Accepts]: Start accepts. Automaton has 16060 states and 21465 transitions. Word has length 71 [2019-09-10 07:01:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:36,177 INFO L475 AbstractCegarLoop]: Abstraction has 16060 states and 21465 transitions. [2019-09-10 07:01:36,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16060 states and 21465 transitions. [2019-09-10 07:01:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:01:36,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:36,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:36,193 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:36,193 INFO L82 PathProgramCache]: Analyzing trace with hash 77939992, now seen corresponding path program 1 times [2019-09-10 07:01:36,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:36,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 07:01:36,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:36,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:36,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:36,551 INFO L87 Difference]: Start difference. First operand 16060 states and 21465 transitions. Second operand 9 states. [2019-09-10 07:01:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:44,966 INFO L93 Difference]: Finished difference Result 43895 states and 61522 transitions. [2019-09-10 07:01:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:01:44,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:01:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:45,068 INFO L225 Difference]: With dead ends: 43895 [2019-09-10 07:01:45,068 INFO L226 Difference]: Without dead ends: 43895 [2019-09-10 07:01:45,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:01:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43895 states. [2019-09-10 07:01:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43895 to 15971. [2019-09-10 07:01:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15971 states. [2019-09-10 07:01:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15971 states to 15971 states and 21344 transitions. [2019-09-10 07:01:45,611 INFO L78 Accepts]: Start accepts. Automaton has 15971 states and 21344 transitions. Word has length 72 [2019-09-10 07:01:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:45,612 INFO L475 AbstractCegarLoop]: Abstraction has 15971 states and 21344 transitions. [2019-09-10 07:01:45,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 15971 states and 21344 transitions. [2019-09-10 07:01:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:01:45,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:45,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:45,622 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:45,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1490375194, now seen corresponding path program 1 times [2019-09-10 07:01:45,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:45,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:45,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:45,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:45,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:45,913 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 07:01:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:45,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:01:45,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:45,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:01:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:01:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:45,915 INFO L87 Difference]: Start difference. First operand 15971 states and 21344 transitions. Second operand 8 states. [2019-09-10 07:01:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:50,796 INFO L93 Difference]: Finished difference Result 36279 states and 52317 transitions. [2019-09-10 07:01:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:01:50,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 07:01:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:50,856 INFO L225 Difference]: With dead ends: 36279 [2019-09-10 07:01:50,857 INFO L226 Difference]: Without dead ends: 36279 [2019-09-10 07:01:50,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:01:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36279 states. [2019-09-10 07:01:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36279 to 15698. [2019-09-10 07:01:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-10 07:01:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20987 transitions. [2019-09-10 07:01:51,331 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20987 transitions. Word has length 72 [2019-09-10 07:01:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:51,331 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20987 transitions. [2019-09-10 07:01:51,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:01:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20987 transitions. [2019-09-10 07:01:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:01:51,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:51,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:51,343 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2027444782, now seen corresponding path program 1 times [2019-09-10 07:01:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:51,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:51,625 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 07:01:51,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:51,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:51,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:51,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:51,627 INFO L87 Difference]: Start difference. First operand 15698 states and 20987 transitions. Second operand 9 states. [2019-09-10 07:01:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:56,731 INFO L93 Difference]: Finished difference Result 21300 states and 29424 transitions. [2019-09-10 07:01:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:01:56,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:01:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:56,763 INFO L225 Difference]: With dead ends: 21300 [2019-09-10 07:01:56,763 INFO L226 Difference]: Without dead ends: 21300 [2019-09-10 07:01:56,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:01:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21300 states. [2019-09-10 07:01:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21300 to 15698. [2019-09-10 07:01:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-10 07:01:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20986 transitions. [2019-09-10 07:01:57,026 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20986 transitions. Word has length 73 [2019-09-10 07:01:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:57,028 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20986 transitions. [2019-09-10 07:01:57,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20986 transitions. [2019-09-10 07:01:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:01:57,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:57,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:57,041 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 233124012, now seen corresponding path program 1 times [2019-09-10 07:01:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:57,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:57,362 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 07:01:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:57,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:57,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:57,365 INFO L87 Difference]: Start difference. First operand 15698 states and 20986 transitions. Second operand 9 states. [2019-09-10 07:02:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:02,867 INFO L93 Difference]: Finished difference Result 24305 states and 33914 transitions. [2019-09-10 07:02:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:02:02,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:02:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:02,893 INFO L225 Difference]: With dead ends: 24305 [2019-09-10 07:02:02,893 INFO L226 Difference]: Without dead ends: 24305 [2019-09-10 07:02:02,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:02:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24305 states. [2019-09-10 07:02:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24305 to 15698. [2019-09-10 07:02:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-10 07:02:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20985 transitions. [2019-09-10 07:02:03,138 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20985 transitions. Word has length 73 [2019-09-10 07:02:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:03,138 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20985 transitions. [2019-09-10 07:02:03,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20985 transitions. [2019-09-10 07:02:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:02:03,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:03,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:03,148 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2019-09-10 07:02:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:03,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:03,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:03,725 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 07:02:03,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:03,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:02:03,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:03,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:02:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:02:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:02:03,726 INFO L87 Difference]: Start difference. First operand 15698 states and 20985 transitions. Second operand 13 states. [2019-09-10 07:02:03,866 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 07:02:04,413 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:02:04,661 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:02:04,920 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:02:05,261 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-10 07:02:06,515 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:02:07,344 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:02:07,770 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 07:02:12,522 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:02:13,014 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:02:14,494 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 07:02:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:15,024 INFO L93 Difference]: Finished difference Result 89810 states and 132873 transitions. [2019-09-10 07:02:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 07:02:15,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 07:02:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:15,114 INFO L225 Difference]: With dead ends: 89810 [2019-09-10 07:02:15,114 INFO L226 Difference]: Without dead ends: 89810 [2019-09-10 07:02:15,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:02:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89810 states. [2019-09-10 07:02:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89810 to 15694. [2019-09-10 07:02:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15694 states. [2019-09-10 07:02:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15694 states to 15694 states and 20981 transitions. [2019-09-10 07:02:15,619 INFO L78 Accepts]: Start accepts. Automaton has 15694 states and 20981 transitions. Word has length 73 [2019-09-10 07:02:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:15,619 INFO L475 AbstractCegarLoop]: Abstraction has 15694 states and 20981 transitions. [2019-09-10 07:02:15,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:02:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15694 states and 20981 transitions. [2019-09-10 07:02:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:02:15,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:15,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:15,627 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash -993343041, now seen corresponding path program 1 times [2019-09-10 07:02:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:15,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:15,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:16,164 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 07:02:16,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:16,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:02:16,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:16,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:02:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:02:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:02:16,168 INFO L87 Difference]: Start difference. First operand 15694 states and 20981 transitions. Second operand 12 states. [2019-09-10 07:02:19,354 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-09-10 07:02:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:20,538 INFO L93 Difference]: Finished difference Result 57212 states and 83967 transitions. [2019-09-10 07:02:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:20,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:02:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:20,592 INFO L225 Difference]: With dead ends: 57212 [2019-09-10 07:02:20,593 INFO L226 Difference]: Without dead ends: 57212 [2019-09-10 07:02:20,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:02:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57212 states. [2019-09-10 07:02:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57212 to 15602. [2019-09-10 07:02:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15602 states. [2019-09-10 07:02:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 20852 transitions. [2019-09-10 07:02:20,919 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 20852 transitions. Word has length 73 [2019-09-10 07:02:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:20,919 INFO L475 AbstractCegarLoop]: Abstraction has 15602 states and 20852 transitions. [2019-09-10 07:02:20,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:02:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 20852 transitions. [2019-09-10 07:02:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:02:20,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:20,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:20,926 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -20725892, now seen corresponding path program 1 times [2019-09-10 07:02:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:20,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:21,580 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 07:02:21,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:21,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:02:21,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:21,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:02:21,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:02:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:02:21,582 INFO L87 Difference]: Start difference. First operand 15602 states and 20852 transitions. Second operand 12 states. [2019-09-10 07:02:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:25,695 INFO L93 Difference]: Finished difference Result 61625 states and 90632 transitions. [2019-09-10 07:02:25,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:25,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 07:02:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:25,758 INFO L225 Difference]: With dead ends: 61625 [2019-09-10 07:02:25,758 INFO L226 Difference]: Without dead ends: 61625 [2019-09-10 07:02:25,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:02:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61625 states. [2019-09-10 07:02:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61625 to 15593. [2019-09-10 07:02:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15593 states. [2019-09-10 07:02:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15593 states to 15593 states and 20842 transitions. [2019-09-10 07:02:26,113 INFO L78 Accepts]: Start accepts. Automaton has 15593 states and 20842 transitions. Word has length 74 [2019-09-10 07:02:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:26,113 INFO L475 AbstractCegarLoop]: Abstraction has 15593 states and 20842 transitions. [2019-09-10 07:02:26,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:02:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15593 states and 20842 transitions. [2019-09-10 07:02:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:02:26,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:26,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:26,121 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 538122635, now seen corresponding path program 1 times [2019-09-10 07:02:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:26,625 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 07:02:26,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:26,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:02:26,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:26,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:02:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:02:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:02:26,629 INFO L87 Difference]: Start difference. First operand 15593 states and 20842 transitions. Second operand 10 states. [2019-09-10 07:02:27,075 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-10 07:02:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:30,748 INFO L93 Difference]: Finished difference Result 57373 states and 84174 transitions. [2019-09-10 07:02:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:02:30,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:02:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:30,804 INFO L225 Difference]: With dead ends: 57373 [2019-09-10 07:02:30,805 INFO L226 Difference]: Without dead ends: 57373 [2019-09-10 07:02:30,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:02:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57373 states. [2019-09-10 07:02:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57373 to 15540. [2019-09-10 07:02:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15540 states. [2019-09-10 07:02:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15540 states to 15540 states and 20781 transitions. [2019-09-10 07:02:31,116 INFO L78 Accepts]: Start accepts. Automaton has 15540 states and 20781 transitions. Word has length 74 [2019-09-10 07:02:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:31,117 INFO L475 AbstractCegarLoop]: Abstraction has 15540 states and 20781 transitions. [2019-09-10 07:02:31,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:02:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 15540 states and 20781 transitions. [2019-09-10 07:02:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:02:31,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:31,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] [2019-09-10 07:02:31,124 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -150966617, now seen corresponding path program 1 times [2019-09-10 07:02:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:31,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:31,270 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 07:02:31,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:31,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:31,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:31,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:31,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:31,272 INFO L87 Difference]: Start difference. First operand 15540 states and 20781 transitions. Second operand 3 states. [2019-09-10 07:02:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:31,434 INFO L93 Difference]: Finished difference Result 14583 states and 20157 transitions. [2019-09-10 07:02:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:31,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:02:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:31,451 INFO L225 Difference]: With dead ends: 14583 [2019-09-10 07:02:31,456 INFO L226 Difference]: Without dead ends: 14583 [2019-09-10 07:02:31,456 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 07:02:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2019-09-10 07:02:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 14564. [2019-09-10 07:02:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-10 07:02:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20144 transitions. [2019-09-10 07:02:31,599 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20144 transitions. Word has length 74 [2019-09-10 07:02:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:31,599 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20144 transitions. [2019-09-10 07:02:31,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20144 transitions. [2019-09-10 07:02:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:31,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:31,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:31,605 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2076823766, now seen corresponding path program 1 times [2019-09-10 07:02:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:31,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:31,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:31,843 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 07:02:31,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:31,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:31,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:31,844 INFO L87 Difference]: Start difference. First operand 14564 states and 20144 transitions. Second operand 9 states. [2019-09-10 07:02:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:37,214 INFO L93 Difference]: Finished difference Result 55347 states and 79787 transitions. [2019-09-10 07:02:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:02:37,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:02:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:37,279 INFO L225 Difference]: With dead ends: 55347 [2019-09-10 07:02:37,280 INFO L226 Difference]: Without dead ends: 55347 [2019-09-10 07:02:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:02:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-10 07:02:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14564. [2019-09-10 07:02:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-10 07:02:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20142 transitions. [2019-09-10 07:02:37,640 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20142 transitions. Word has length 75 [2019-09-10 07:02:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:37,640 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20142 transitions. [2019-09-10 07:02:37,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20142 transitions. [2019-09-10 07:02:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:37,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:37,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:37,647 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -68973770, now seen corresponding path program 1 times [2019-09-10 07:02:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:37,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:37,887 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 07:02:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:02:37,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:37,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:02:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:02:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:02:37,889 INFO L87 Difference]: Start difference. First operand 14564 states and 20142 transitions. Second operand 8 states. [2019-09-10 07:02:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:41,351 INFO L93 Difference]: Finished difference Result 48428 states and 71633 transitions. [2019-09-10 07:02:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:02:41,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2019-09-10 07:02:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:41,565 INFO L225 Difference]: With dead ends: 48428 [2019-09-10 07:02:41,565 INFO L226 Difference]: Without dead ends: 48428 [2019-09-10 07:02:41,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:02:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48428 states. [2019-09-10 07:02:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48428 to 14564. [2019-09-10 07:02:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-10 07:02:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20141 transitions. [2019-09-10 07:02:41,825 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20141 transitions. Word has length 75 [2019-09-10 07:02:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:41,825 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20141 transitions. [2019-09-10 07:02:41,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:02:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20141 transitions. [2019-09-10 07:02:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:41,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:41,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:41,831 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:41,832 INFO L82 PathProgramCache]: Analyzing trace with hash 537217189, now seen corresponding path program 1 times [2019-09-10 07:02:41,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:41,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:41,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:41,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:41,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:42,052 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 07:02:42,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:42,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:42,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:42,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:42,054 INFO L87 Difference]: Start difference. First operand 14564 states and 20141 transitions. Second operand 9 states. [2019-09-10 07:02:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:48,591 INFO L93 Difference]: Finished difference Result 55347 states and 79785 transitions. [2019-09-10 07:02:48,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:02:48,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:02:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:48,640 INFO L225 Difference]: With dead ends: 55347 [2019-09-10 07:02:48,641 INFO L226 Difference]: Without dead ends: 55347 [2019-09-10 07:02:48,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:02:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-10 07:02:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14564. [2019-09-10 07:02:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-10 07:02:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20140 transitions. [2019-09-10 07:02:48,929 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20140 transitions. Word has length 75 [2019-09-10 07:02:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:48,929 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20140 transitions. [2019-09-10 07:02:48,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20140 transitions. [2019-09-10 07:02:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:48,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:48,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:48,933 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash 886824694, now seen corresponding path program 1 times [2019-09-10 07:02:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:48,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:49,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:49,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:49,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:49,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:49,151 INFO L87 Difference]: Start difference. First operand 14564 states and 20140 transitions. Second operand 9 states. [2019-09-10 07:02:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:53,624 INFO L93 Difference]: Finished difference Result 48999 states and 72219 transitions. [2019-09-10 07:02:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:02:53,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:02:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:53,680 INFO L225 Difference]: With dead ends: 48999 [2019-09-10 07:02:53,681 INFO L226 Difference]: Without dead ends: 48999 [2019-09-10 07:02:53,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:02:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48999 states. [2019-09-10 07:02:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48999 to 14564. [2019-09-10 07:02:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-10 07:02:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20139 transitions. [2019-09-10 07:02:53,981 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20139 transitions. Word has length 75 [2019-09-10 07:02:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:53,981 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20139 transitions. [2019-09-10 07:02:53,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20139 transitions. [2019-09-10 07:02:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:53,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:53,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:53,986 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -553258111, now seen corresponding path program 1 times [2019-09-10 07:02:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:53,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:53,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:54,131 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 07:02:54,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:54,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:54,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:54,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:54,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:54,134 INFO L87 Difference]: Start difference. First operand 14564 states and 20139 transitions. Second operand 3 states. [2019-09-10 07:02:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:54,427 INFO L93 Difference]: Finished difference Result 16782 states and 23970 transitions. [2019-09-10 07:02:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:54,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:02:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:54,442 INFO L225 Difference]: With dead ends: 16782 [2019-09-10 07:02:54,443 INFO L226 Difference]: Without dead ends: 16782 [2019-09-10 07:02:54,443 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 07:02:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2019-09-10 07:02:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16774. [2019-09-10 07:02:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2019-09-10 07:02:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 23966 transitions. [2019-09-10 07:02:54,579 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 23966 transitions. Word has length 75 [2019-09-10 07:02:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:54,579 INFO L475 AbstractCegarLoop]: Abstraction has 16774 states and 23966 transitions. [2019-09-10 07:02:54,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 23966 transitions. [2019-09-10 07:02:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:54,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:54,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:54,583 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2136318529, now seen corresponding path program 1 times [2019-09-10 07:02:54,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:54,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:54,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:54,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:54,717 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 07:02:54,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:54,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:54,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:54,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:54,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:54,720 INFO L87 Difference]: Start difference. First operand 16774 states and 23966 transitions. Second operand 3 states. [2019-09-10 07:02:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:54,929 INFO L93 Difference]: Finished difference Result 27400 states and 39196 transitions. [2019-09-10 07:02:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:54,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:02:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:54,958 INFO L225 Difference]: With dead ends: 27400 [2019-09-10 07:02:54,958 INFO L226 Difference]: Without dead ends: 27400 [2019-09-10 07:02:54,958 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 07:02:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27400 states. [2019-09-10 07:02:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27400 to 27392. [2019-09-10 07:02:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27392 states. [2019-09-10 07:02:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27392 states to 27392 states and 39192 transitions. [2019-09-10 07:02:55,205 INFO L78 Accepts]: Start accepts. Automaton has 27392 states and 39192 transitions. Word has length 76 [2019-09-10 07:02:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:55,206 INFO L475 AbstractCegarLoop]: Abstraction has 27392 states and 39192 transitions. [2019-09-10 07:02:55,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27392 states and 39192 transitions. [2019-09-10 07:02:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:55,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:55,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:55,210 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1610299721, now seen corresponding path program 1 times [2019-09-10 07:02:55,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:55,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:55,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:55,349 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 07:02:55,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:55,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:55,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:55,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:55,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:55,351 INFO L87 Difference]: Start difference. First operand 27392 states and 39192 transitions. Second operand 3 states. [2019-09-10 07:02:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:55,579 INFO L93 Difference]: Finished difference Result 46977 states and 67379 transitions. [2019-09-10 07:02:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:55,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:02:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:55,625 INFO L225 Difference]: With dead ends: 46977 [2019-09-10 07:02:55,625 INFO L226 Difference]: Without dead ends: 46977 [2019-09-10 07:02:55,627 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 07:02:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46977 states. [2019-09-10 07:02:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46977 to 40251. [2019-09-10 07:02:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-09-10 07:02:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 57455 transitions. [2019-09-10 07:02:56,003 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 57455 transitions. Word has length 76 [2019-09-10 07:02:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:56,004 INFO L475 AbstractCegarLoop]: Abstraction has 40251 states and 57455 transitions. [2019-09-10 07:02:56,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 57455 transitions. [2019-09-10 07:02:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:56,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:56,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:56,009 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1479085215, now seen corresponding path program 1 times [2019-09-10 07:02:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:56,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:56,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:56,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:56,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:56,148 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 07:02:56,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:56,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:56,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:56,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:56,150 INFO L87 Difference]: Start difference. First operand 40251 states and 57455 transitions. Second operand 3 states. [2019-09-10 07:02:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:56,365 INFO L93 Difference]: Finished difference Result 67667 states and 97204 transitions. [2019-09-10 07:02:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:56,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:02:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:56,435 INFO L225 Difference]: With dead ends: 67667 [2019-09-10 07:02:56,436 INFO L226 Difference]: Without dead ends: 67667 [2019-09-10 07:02:56,436 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 07:02:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67667 states. [2019-09-10 07:02:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67667 to 48575. [2019-09-10 07:02:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48575 states. [2019-09-10 07:02:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48575 states to 48575 states and 69353 transitions. [2019-09-10 07:02:57,238 INFO L78 Accepts]: Start accepts. Automaton has 48575 states and 69353 transitions. Word has length 76 [2019-09-10 07:02:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:57,238 INFO L475 AbstractCegarLoop]: Abstraction has 48575 states and 69353 transitions. [2019-09-10 07:02:57,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 48575 states and 69353 transitions. [2019-09-10 07:02:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:02:57,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:57,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] [2019-09-10 07:02:57,244 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1487016584, now seen corresponding path program 1 times [2019-09-10 07:02:57,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:57,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:57,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:57,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:57,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 07:02:57,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:57,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:57,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:57,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:57,506 INFO L87 Difference]: Start difference. First operand 48575 states and 69353 transitions. Second operand 9 states. [2019-09-10 07:03:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:00,829 INFO L93 Difference]: Finished difference Result 107703 states and 155298 transitions. [2019-09-10 07:03:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:03:00,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 07:03:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:00,944 INFO L225 Difference]: With dead ends: 107703 [2019-09-10 07:03:00,945 INFO L226 Difference]: Without dead ends: 107703 [2019-09-10 07:03:00,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:03:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107703 states. [2019-09-10 07:03:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107703 to 48570. [2019-09-10 07:03:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48570 states. [2019-09-10 07:03:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48570 states to 48570 states and 69344 transitions. [2019-09-10 07:03:03,415 INFO L78 Accepts]: Start accepts. Automaton has 48570 states and 69344 transitions. Word has length 77 [2019-09-10 07:03:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:03,415 INFO L475 AbstractCegarLoop]: Abstraction has 48570 states and 69344 transitions. [2019-09-10 07:03:03,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 48570 states and 69344 transitions. [2019-09-10 07:03:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:03:03,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:03,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:03,421 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -622390050, now seen corresponding path program 1 times [2019-09-10 07:03:03,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:03,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:03,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:03,559 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 07:03:03,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:03,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:03,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:03,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:03,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:03,561 INFO L87 Difference]: Start difference. First operand 48570 states and 69344 transitions. Second operand 3 states. [2019-09-10 07:03:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:03,926 INFO L93 Difference]: Finished difference Result 79658 states and 115182 transitions. [2019-09-10 07:03:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:03,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:03:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:04,045 INFO L225 Difference]: With dead ends: 79658 [2019-09-10 07:03:04,046 INFO L226 Difference]: Without dead ends: 79658 [2019-09-10 07:03:04,046 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 07:03:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79658 states. [2019-09-10 07:03:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79658 to 62138. [2019-09-10 07:03:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62138 states. [2019-09-10 07:03:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62138 states to 62138 states and 89664 transitions. [2019-09-10 07:03:04,874 INFO L78 Accepts]: Start accepts. Automaton has 62138 states and 89664 transitions. Word has length 77 [2019-09-10 07:03:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:04,874 INFO L475 AbstractCegarLoop]: Abstraction has 62138 states and 89664 transitions. [2019-09-10 07:03:04,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 62138 states and 89664 transitions. [2019-09-10 07:03:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:03:04,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:04,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:04,878 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:04,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1208905319, now seen corresponding path program 1 times [2019-09-10 07:03:04,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:04,998 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 07:03:04,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:04,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:04,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:04,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:04,999 INFO L87 Difference]: Start difference. First operand 62138 states and 89664 transitions. Second operand 3 states. [2019-09-10 07:03:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:05,342 INFO L93 Difference]: Finished difference Result 74399 states and 107467 transitions. [2019-09-10 07:03:05,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:05,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:03:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:05,427 INFO L225 Difference]: With dead ends: 74399 [2019-09-10 07:03:05,427 INFO L226 Difference]: Without dead ends: 74399 [2019-09-10 07:03:05,427 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 07:03:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74399 states. [2019-09-10 07:03:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74399 to 59195. [2019-09-10 07:03:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85757 transitions. [2019-09-10 07:03:06,630 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85757 transitions. Word has length 77 [2019-09-10 07:03:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:06,630 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85757 transitions. [2019-09-10 07:03:06,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85757 transitions. [2019-09-10 07:03:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:03:06,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:06,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:06,633 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash 623453508, now seen corresponding path program 1 times [2019-09-10 07:03:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:06,861 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 07:03:06,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:06,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:03:06,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:06,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:03:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:03:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:06,863 INFO L87 Difference]: Start difference. First operand 59195 states and 85757 transitions. Second operand 9 states. [2019-09-10 07:03:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:10,381 INFO L93 Difference]: Finished difference Result 137812 states and 199963 transitions. [2019-09-10 07:03:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:03:10,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:03:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:10,559 INFO L225 Difference]: With dead ends: 137812 [2019-09-10 07:03:10,559 INFO L226 Difference]: Without dead ends: 137812 [2019-09-10 07:03:10,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:03:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137812 states. [2019-09-10 07:03:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137812 to 59195. [2019-09-10 07:03:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85755 transitions. [2019-09-10 07:03:12,065 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85755 transitions. Word has length 78 [2019-09-10 07:03:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:12,066 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85755 transitions. [2019-09-10 07:03:12,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85755 transitions. [2019-09-10 07:03:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:03:12,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:12,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:12,069 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 858175544, now seen corresponding path program 1 times [2019-09-10 07:03:12,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:12,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:12,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:12,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:12,275 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 07:03:12,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:12,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:03:12,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:12,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:03:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:03:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:12,277 INFO L87 Difference]: Start difference. First operand 59195 states and 85755 transitions. Second operand 9 states. [2019-09-10 07:03:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:15,824 INFO L93 Difference]: Finished difference Result 137796 states and 199945 transitions. [2019-09-10 07:03:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:03:15,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:03:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:15,983 INFO L225 Difference]: With dead ends: 137796 [2019-09-10 07:03:15,984 INFO L226 Difference]: Without dead ends: 137796 [2019-09-10 07:03:15,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:03:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137796 states. [2019-09-10 07:03:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137796 to 59195. [2019-09-10 07:03:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85753 transitions. [2019-09-10 07:03:19,322 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85753 transitions. Word has length 78 [2019-09-10 07:03:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:19,323 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85753 transitions. [2019-09-10 07:03:19,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85753 transitions. [2019-09-10 07:03:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:03:19,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:19,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:19,326 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 138734116, now seen corresponding path program 1 times [2019-09-10 07:03:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:19,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:19,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:03:19,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:19,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:03:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:03:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:19,537 INFO L87 Difference]: Start difference. First operand 59195 states and 85753 transitions. Second operand 9 states. [2019-09-10 07:03:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:22,955 INFO L93 Difference]: Finished difference Result 137796 states and 199943 transitions. [2019-09-10 07:03:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:03:22,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:03:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:23,131 INFO L225 Difference]: With dead ends: 137796 [2019-09-10 07:03:23,131 INFO L226 Difference]: Without dead ends: 137796 [2019-09-10 07:03:23,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:03:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137796 states. [2019-09-10 07:03:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137796 to 59195. [2019-09-10 07:03:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85751 transitions. [2019-09-10 07:03:24,209 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85751 transitions. Word has length 78 [2019-09-10 07:03:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:24,209 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85751 transitions. [2019-09-10 07:03:24,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85751 transitions. [2019-09-10 07:03:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:03:24,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:24,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:03:24,212 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 960156932, now seen corresponding path program 1 times [2019-09-10 07:03:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:24,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:24,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:24,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 07:03:24,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:24,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:03:24,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:24,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:03:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:03:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:24,402 INFO L87 Difference]: Start difference. First operand 59195 states and 85751 transitions. Second operand 9 states. [2019-09-10 07:03:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:27,872 INFO L93 Difference]: Finished difference Result 137796 states and 199942 transitions. [2019-09-10 07:03:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:03:27,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:03:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:28,032 INFO L225 Difference]: With dead ends: 137796 [2019-09-10 07:03:28,033 INFO L226 Difference]: Without dead ends: 137796 [2019-09-10 07:03:28,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:03:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137796 states. [2019-09-10 07:03:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137796 to 59195. [2019-09-10 07:03:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85750 transitions. [2019-09-10 07:03:29,087 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85750 transitions. Word has length 78 [2019-09-10 07:03:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:29,088 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85750 transitions. [2019-09-10 07:03:29,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85750 transitions. [2019-09-10 07:03:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:03:29,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:29,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] [2019-09-10 07:03:29,090 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1614737059, now seen corresponding path program 1 times [2019-09-10 07:03:29,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:29,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:29,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:29,286 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 07:03:29,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:29,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:03:29,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:29,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:03:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:03:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:29,287 INFO L87 Difference]: Start difference. First operand 59195 states and 85750 transitions. Second operand 9 states. [2019-09-10 07:03:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:32,492 INFO L93 Difference]: Finished difference Result 104186 states and 150772 transitions. [2019-09-10 07:03:32,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:03:32,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:03:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:32,599 INFO L225 Difference]: With dead ends: 104186 [2019-09-10 07:03:32,599 INFO L226 Difference]: Without dead ends: 104186 [2019-09-10 07:03:32,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:03:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104186 states. [2019-09-10 07:03:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104186 to 59195. [2019-09-10 07:03:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-10 07:03:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85749 transitions. [2019-09-10 07:03:33,402 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85749 transitions. Word has length 78 [2019-09-10 07:03:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:33,403 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85749 transitions. [2019-09-10 07:03:33,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85749 transitions. [2019-09-10 07:03:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:03:33,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:33,405 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] [2019-09-10 07:03:33,405 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash -939828288, now seen corresponding path program 1 times [2019-09-10 07:03:33,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:33,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:33,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:33,522 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 07:03:33,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:33,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:33,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:33,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:33,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:33,524 INFO L87 Difference]: Start difference. First operand 59195 states and 85749 transitions. Second operand 3 states. [2019-09-10 07:03:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:33,805 INFO L93 Difference]: Finished difference Result 107683 states and 154407 transitions. [2019-09-10 07:03:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:33,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:03:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:33,933 INFO L225 Difference]: With dead ends: 107683 [2019-09-10 07:03:33,933 INFO L226 Difference]: Without dead ends: 107683 [2019-09-10 07:03:33,934 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 07:03:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107683 states. [2019-09-10 07:03:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107683 to 74599. [2019-09-10 07:03:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74599 states. [2019-09-10 07:03:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74599 states to 74599 states and 106834 transitions. [2019-09-10 07:03:34,911 INFO L78 Accepts]: Start accepts. Automaton has 74599 states and 106834 transitions. Word has length 79 [2019-09-10 07:03:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:34,911 INFO L475 AbstractCegarLoop]: Abstraction has 74599 states and 106834 transitions. [2019-09-10 07:03:34,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 74599 states and 106834 transitions. [2019-09-10 07:03:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:34,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:34,916 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] [2019-09-10 07:03:34,916 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:34,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 580694754, now seen corresponding path program 1 times [2019-09-10 07:03:34,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:34,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:34,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:34,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:36,419 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 07:03:36,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:36,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:03:36,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:36,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:03:36,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:03:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:03:36,420 INFO L87 Difference]: Start difference. First operand 74599 states and 106834 transitions. Second operand 19 states. [2019-09-10 07:03:36,564 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:03:37,219 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:03:37,547 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:03:37,915 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:03:38,100 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:03:38,417 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:03:38,564 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 07:03:38,762 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:03:38,971 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:03:39,504 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:03:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:45,664 INFO L93 Difference]: Finished difference Result 115380 states and 164271 transitions. [2019-09-10 07:03:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:03:45,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2019-09-10 07:03:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:45,801 INFO L225 Difference]: With dead ends: 115380 [2019-09-10 07:03:45,801 INFO L226 Difference]: Without dead ends: 115380 [2019-09-10 07:03:45,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:03:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115380 states. [2019-09-10 07:03:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115380 to 74558. [2019-09-10 07:03:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74558 states. [2019-09-10 07:03:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74558 states to 74558 states and 106780 transitions. [2019-09-10 07:03:47,219 INFO L78 Accepts]: Start accepts. Automaton has 74558 states and 106780 transitions. Word has length 81 [2019-09-10 07:03:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:47,219 INFO L475 AbstractCegarLoop]: Abstraction has 74558 states and 106780 transitions. [2019-09-10 07:03:47,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:03:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 74558 states and 106780 transitions. [2019-09-10 07:03:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:47,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:47,222 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] [2019-09-10 07:03:47,223 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:47,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2015932355, now seen corresponding path program 1 times [2019-09-10 07:03:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:47,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:48,524 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 07:03:48,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:48,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:03:48,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:48,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:03:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:03:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:03:48,525 INFO L87 Difference]: Start difference. First operand 74558 states and 106780 transitions. Second operand 21 states. [2019-09-10 07:03:49,181 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:03:49,480 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:03:49,920 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 07:03:50,222 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:03:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:57,211 INFO L93 Difference]: Finished difference Result 82232 states and 117466 transitions. [2019-09-10 07:03:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:03:57,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-09-10 07:03:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:57,307 INFO L225 Difference]: With dead ends: 82232 [2019-09-10 07:03:57,307 INFO L226 Difference]: Without dead ends: 82232 [2019-09-10 07:03:57,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:03:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82232 states. [2019-09-10 07:03:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82232 to 74549. [2019-09-10 07:03:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74549 states. [2019-09-10 07:03:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74549 states to 74549 states and 106765 transitions. [2019-09-10 07:03:58,608 INFO L78 Accepts]: Start accepts. Automaton has 74549 states and 106765 transitions. Word has length 81 [2019-09-10 07:03:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:58,609 INFO L475 AbstractCegarLoop]: Abstraction has 74549 states and 106765 transitions. [2019-09-10 07:03:58,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:03:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 74549 states and 106765 transitions. [2019-09-10 07:03:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:58,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:58,612 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] [2019-09-10 07:03:58,612 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2007393057, now seen corresponding path program 1 times [2019-09-10 07:03:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:58,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:58,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:59,216 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 07:03:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:03:59,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:59,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:03:59,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:03:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:03:59,219 INFO L87 Difference]: Start difference. First operand 74549 states and 106765 transitions. Second operand 14 states. [2019-09-10 07:04:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:02,285 INFO L93 Difference]: Finished difference Result 81260 states and 116291 transitions. [2019-09-10 07:04:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:04:02,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2019-09-10 07:04:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:02,361 INFO L225 Difference]: With dead ends: 81260 [2019-09-10 07:04:02,362 INFO L226 Difference]: Without dead ends: 81260 [2019-09-10 07:04:02,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:04:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81260 states. [2019-09-10 07:04:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81260 to 74547. [2019-09-10 07:04:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74547 states. [2019-09-10 07:04:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74547 states to 74547 states and 106761 transitions. [2019-09-10 07:04:03,144 INFO L78 Accepts]: Start accepts. Automaton has 74547 states and 106761 transitions. Word has length 81 [2019-09-10 07:04:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:03,144 INFO L475 AbstractCegarLoop]: Abstraction has 74547 states and 106761 transitions. [2019-09-10 07:04:03,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:04:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 74547 states and 106761 transitions. [2019-09-10 07:04:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:04:03,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:03,147 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] [2019-09-10 07:04:03,148 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1374131754, now seen corresponding path program 1 times [2019-09-10 07:04:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:03,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:03,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:03,889 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 07:04:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:04:03,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:03,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:04:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:04:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:04:03,891 INFO L87 Difference]: Start difference. First operand 74547 states and 106761 transitions. Second operand 17 states. [2019-09-10 07:04:04,668 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:04:07,884 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:04:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:09,938 INFO L93 Difference]: Finished difference Result 161466 states and 230539 transitions. [2019-09-10 07:04:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:04:09,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-10 07:04:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:10,133 INFO L225 Difference]: With dead ends: 161466 [2019-09-10 07:04:10,133 INFO L226 Difference]: Without dead ends: 161466 [2019-09-10 07:04:10,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:04:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161466 states. [2019-09-10 07:04:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161466 to 74504. [2019-09-10 07:04:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74504 states. [2019-09-10 07:04:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74504 states to 74504 states and 106706 transitions. [2019-09-10 07:04:11,561 INFO L78 Accepts]: Start accepts. Automaton has 74504 states and 106706 transitions. Word has length 81 [2019-09-10 07:04:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:11,561 INFO L475 AbstractCegarLoop]: Abstraction has 74504 states and 106706 transitions. [2019-09-10 07:04:11,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:04:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74504 states and 106706 transitions. [2019-09-10 07:04:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:04:11,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:11,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:11,565 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -854077492, now seen corresponding path program 1 times [2019-09-10 07:04:11,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:11,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:12,168 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-09-10 07:04:12,899 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 07:04:12,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:12,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:04:12,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:12,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:04:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:04:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:04:12,901 INFO L87 Difference]: Start difference. First operand 74504 states and 106706 transitions. Second operand 18 states. [2019-09-10 07:04:13,709 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:04:13,929 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:04:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:21,888 INFO L93 Difference]: Finished difference Result 108495 states and 154549 transitions. [2019-09-10 07:04:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:04:21,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-10 07:04:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:22,020 INFO L225 Difference]: With dead ends: 108495 [2019-09-10 07:04:22,020 INFO L226 Difference]: Without dead ends: 108495 [2019-09-10 07:04:22,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:04:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108495 states. [2019-09-10 07:04:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108495 to 74502. [2019-09-10 07:04:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74502 states. [2019-09-10 07:04:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74502 states to 74502 states and 106702 transitions. [2019-09-10 07:04:23,406 INFO L78 Accepts]: Start accepts. Automaton has 74502 states and 106702 transitions. Word has length 81 [2019-09-10 07:04:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:23,407 INFO L475 AbstractCegarLoop]: Abstraction has 74502 states and 106702 transitions. [2019-09-10 07:04:23,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:04:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 74502 states and 106702 transitions. [2019-09-10 07:04:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:23,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:23,410 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] [2019-09-10 07:04:23,410 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 48032834, now seen corresponding path program 1 times [2019-09-10 07:04:23,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:23,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:23,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:24,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 07:04:24,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:24,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:04:24,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:24,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:04:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:04:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:04:24,230 INFO L87 Difference]: Start difference. First operand 74502 states and 106702 transitions. Second operand 16 states. [2019-09-10 07:04:26,286 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:04:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:28,815 INFO L93 Difference]: Finished difference Result 153903 states and 220993 transitions. [2019-09-10 07:04:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:04:28,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2019-09-10 07:04:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:29,019 INFO L225 Difference]: With dead ends: 153903 [2019-09-10 07:04:29,019 INFO L226 Difference]: Without dead ends: 153903 [2019-09-10 07:04:29,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:04:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153903 states. [2019-09-10 07:04:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153903 to 74498. [2019-09-10 07:04:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74498 states. [2019-09-10 07:04:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74498 states to 74498 states and 106694 transitions. [2019-09-10 07:04:31,080 INFO L78 Accepts]: Start accepts. Automaton has 74498 states and 106694 transitions. Word has length 82 [2019-09-10 07:04:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:31,081 INFO L475 AbstractCegarLoop]: Abstraction has 74498 states and 106694 transitions. [2019-09-10 07:04:31,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:04:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 74498 states and 106694 transitions. [2019-09-10 07:04:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:31,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:31,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] [2019-09-10 07:04:31,084 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash 88098169, now seen corresponding path program 1 times [2019-09-10 07:04:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:31,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:31,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:31,642 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 07:04:31,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:31,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:04:31,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:31,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:04:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:04:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:04:31,648 INFO L87 Difference]: Start difference. First operand 74498 states and 106694 transitions. Second operand 10 states. [2019-09-10 07:04:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:34,106 INFO L93 Difference]: Finished difference Result 193362 states and 277108 transitions. [2019-09-10 07:04:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:04:34,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2019-09-10 07:04:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:34,374 INFO L225 Difference]: With dead ends: 193362 [2019-09-10 07:04:34,374 INFO L226 Difference]: Without dead ends: 193362 [2019-09-10 07:04:34,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:04:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193362 states. [2019-09-10 07:04:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193362 to 74343. [2019-09-10 07:04:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74343 states. [2019-09-10 07:04:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74343 states to 74343 states and 106512 transitions. [2019-09-10 07:04:36,064 INFO L78 Accepts]: Start accepts. Automaton has 74343 states and 106512 transitions. Word has length 82 [2019-09-10 07:04:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:36,064 INFO L475 AbstractCegarLoop]: Abstraction has 74343 states and 106512 transitions. [2019-09-10 07:04:36,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 74343 states and 106512 transitions. [2019-09-10 07:04:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:36,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:36,068 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] [2019-09-10 07:04:36,068 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1069130758, now seen corresponding path program 1 times [2019-09-10 07:04:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:37,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 07:04:37,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:37,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:04:37,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:37,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:04:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:04:37,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:04:37,070 INFO L87 Difference]: Start difference. First operand 74343 states and 106512 transitions. Second operand 12 states. [2019-09-10 07:04:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:39,595 INFO L93 Difference]: Finished difference Result 201565 states and 289325 transitions. [2019-09-10 07:04:39,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:04:39,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 07:04:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:39,862 INFO L225 Difference]: With dead ends: 201565 [2019-09-10 07:04:39,862 INFO L226 Difference]: Without dead ends: 201565 [2019-09-10 07:04:39,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:04:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201565 states. [2019-09-10 07:04:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201565 to 74305. [2019-09-10 07:04:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74305 states. [2019-09-10 07:04:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74305 states to 74305 states and 106467 transitions. [2019-09-10 07:04:41,588 INFO L78 Accepts]: Start accepts. Automaton has 74305 states and 106467 transitions. Word has length 82 [2019-09-10 07:04:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:41,588 INFO L475 AbstractCegarLoop]: Abstraction has 74305 states and 106467 transitions. [2019-09-10 07:04:41,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:04:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 74305 states and 106467 transitions. [2019-09-10 07:04:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:41,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:41,591 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] [2019-09-10 07:04:41,591 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1514347485, now seen corresponding path program 1 times [2019-09-10 07:04:41,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:41,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:41,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:42,273 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 07:04:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:04:42,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:42,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:04:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:04:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:04:42,276 INFO L87 Difference]: Start difference. First operand 74305 states and 106467 transitions. Second operand 12 states. [2019-09-10 07:04:43,159 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:04:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:44,819 INFO L93 Difference]: Finished difference Result 129850 states and 185946 transitions. [2019-09-10 07:04:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:04:44,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 07:04:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:45,012 INFO L225 Difference]: With dead ends: 129850 [2019-09-10 07:04:45,012 INFO L226 Difference]: Without dead ends: 129850 [2019-09-10 07:04:45,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:04:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129850 states. [2019-09-10 07:04:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129850 to 74301. [2019-09-10 07:04:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74301 states. [2019-09-10 07:04:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74301 states to 74301 states and 106462 transitions. [2019-09-10 07:04:46,232 INFO L78 Accepts]: Start accepts. Automaton has 74301 states and 106462 transitions. Word has length 82 [2019-09-10 07:04:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:46,232 INFO L475 AbstractCegarLoop]: Abstraction has 74301 states and 106462 transitions. [2019-09-10 07:04:46,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:04:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74301 states and 106462 transitions. [2019-09-10 07:04:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:04:46,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:46,239 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] [2019-09-10 07:04:46,240 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1313506110, now seen corresponding path program 1 times [2019-09-10 07:04:46,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:46,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:46,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:46,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:46,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:46,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:46,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:04:46,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:46,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:04:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:04:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:04:46,444 INFO L87 Difference]: Start difference. First operand 74301 states and 106462 transitions. Second operand 7 states. [2019-09-10 07:04:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:47,503 INFO L93 Difference]: Finished difference Result 334959 states and 469275 transitions. [2019-09-10 07:04:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:04:47,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:04:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:48,017 INFO L225 Difference]: With dead ends: 334959 [2019-09-10 07:04:48,017 INFO L226 Difference]: Without dead ends: 334959 [2019-09-10 07:04:48,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:04:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334959 states. [2019-09-10 07:04:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334959 to 259359. [2019-09-10 07:04:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259359 states. [2019-09-10 07:04:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259359 states to 259359 states and 364077 transitions. [2019-09-10 07:04:55,601 INFO L78 Accepts]: Start accepts. Automaton has 259359 states and 364077 transitions. Word has length 88 [2019-09-10 07:04:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:55,601 INFO L475 AbstractCegarLoop]: Abstraction has 259359 states and 364077 transitions. [2019-09-10 07:04:55,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:04:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 259359 states and 364077 transitions. [2019-09-10 07:04:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:04:55,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:55,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:55,611 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1708838686, now seen corresponding path program 1 times [2019-09-10 07:04:55,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:55,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:55,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:55,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:55,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:55,804 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 07:04:55,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:55,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:04:55,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:55,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:04:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:04:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:04:55,806 INFO L87 Difference]: Start difference. First operand 259359 states and 364077 transitions. Second operand 6 states. [2019-09-10 07:04:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:56,761 INFO L93 Difference]: Finished difference Result 168184 states and 232028 transitions. [2019-09-10 07:04:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:04:56,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 07:04:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:56,970 INFO L225 Difference]: With dead ends: 168184 [2019-09-10 07:04:56,970 INFO L226 Difference]: Without dead ends: 168184 [2019-09-10 07:04:56,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:04:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168184 states. [2019-09-10 07:04:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168184 to 167358. [2019-09-10 07:04:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167358 states. [2019-09-10 07:04:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167358 states to 167358 states and 231205 transitions. [2019-09-10 07:04:59,879 INFO L78 Accepts]: Start accepts. Automaton has 167358 states and 231205 transitions. Word has length 89 [2019-09-10 07:04:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:59,879 INFO L475 AbstractCegarLoop]: Abstraction has 167358 states and 231205 transitions. [2019-09-10 07:04:59,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:04:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 167358 states and 231205 transitions. [2019-09-10 07:04:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:04:59,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:59,889 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] [2019-09-10 07:04:59,889 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 853604417, now seen corresponding path program 1 times [2019-09-10 07:04:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:59,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:59,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:00,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:00,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:00,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:00,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:00,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:00,055 INFO L87 Difference]: Start difference. First operand 167358 states and 231205 transitions. Second operand 6 states. [2019-09-10 07:05:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:00,867 INFO L93 Difference]: Finished difference Result 290044 states and 395131 transitions. [2019-09-10 07:05:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:05:00,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 07:05:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:01,228 INFO L225 Difference]: With dead ends: 290044 [2019-09-10 07:05:01,228 INFO L226 Difference]: Without dead ends: 290044 [2019-09-10 07:05:01,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290044 states. [2019-09-10 07:05:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290044 to 171732. [2019-09-10 07:05:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171732 states. [2019-09-10 07:05:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171732 states to 171732 states and 234606 transitions. [2019-09-10 07:05:08,243 INFO L78 Accepts]: Start accepts. Automaton has 171732 states and 234606 transitions. Word has length 91 [2019-09-10 07:05:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:08,243 INFO L475 AbstractCegarLoop]: Abstraction has 171732 states and 234606 transitions. [2019-09-10 07:05:08,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 171732 states and 234606 transitions. [2019-09-10 07:05:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:05:08,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:08,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:08,254 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:08,254 INFO L82 PathProgramCache]: Analyzing trace with hash 605690199, now seen corresponding path program 1 times [2019-09-10 07:05:08,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:08,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 07:05:08,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:08,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:08,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:08,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:08,404 INFO L87 Difference]: Start difference. First operand 171732 states and 234606 transitions. Second operand 3 states. [2019-09-10 07:05:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:09,183 INFO L93 Difference]: Finished difference Result 313301 states and 425688 transitions. [2019-09-10 07:05:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:09,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:05:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:09,586 INFO L225 Difference]: With dead ends: 313301 [2019-09-10 07:05:09,586 INFO L226 Difference]: Without dead ends: 313301 [2019-09-10 07:05:09,587 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 07:05:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313301 states. [2019-09-10 07:05:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313301 to 313299. [2019-09-10 07:05:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313299 states. [2019-09-10 07:05:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313299 states to 313299 states and 425687 transitions. [2019-09-10 07:05:17,798 INFO L78 Accepts]: Start accepts. Automaton has 313299 states and 425687 transitions. Word has length 92 [2019-09-10 07:05:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:17,799 INFO L475 AbstractCegarLoop]: Abstraction has 313299 states and 425687 transitions. [2019-09-10 07:05:17,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 313299 states and 425687 transitions. [2019-09-10 07:05:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:05:17,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:17,814 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] [2019-09-10 07:05:17,814 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash -917889665, now seen corresponding path program 1 times [2019-09-10 07:05:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:17,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:17,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:17,929 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 07:05:17,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:17,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:17,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:17,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:17,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:17,930 INFO L87 Difference]: Start difference. First operand 313299 states and 425687 transitions. Second operand 5 states. [2019-09-10 07:05:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:28,983 INFO L93 Difference]: Finished difference Result 912342 states and 1221750 transitions. [2019-09-10 07:05:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:05:28,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 07:05:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:30,334 INFO L225 Difference]: With dead ends: 912342 [2019-09-10 07:05:30,334 INFO L226 Difference]: Without dead ends: 912342 [2019-09-10 07:05:30,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912342 states. [2019-09-10 07:05:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912342 to 554528. [2019-09-10 07:05:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554528 states. [2019-09-10 07:05:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554528 states to 554528 states and 745909 transitions. [2019-09-10 07:05:49,095 INFO L78 Accepts]: Start accepts. Automaton has 554528 states and 745909 transitions. Word has length 93 [2019-09-10 07:05:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:49,095 INFO L475 AbstractCegarLoop]: Abstraction has 554528 states and 745909 transitions. [2019-09-10 07:05:49,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 554528 states and 745909 transitions. [2019-09-10 07:05:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:05:49,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:49,108 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] [2019-09-10 07:05:49,108 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1334123158, now seen corresponding path program 1 times [2019-09-10 07:05:49,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:49,219 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 07:05:49,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:49,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:49,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:49,220 INFO L87 Difference]: Start difference. First operand 554528 states and 745909 transitions. Second operand 5 states. [2019-09-10 07:05:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:54,981 INFO L93 Difference]: Finished difference Result 1189654 states and 1585390 transitions. [2019-09-10 07:05:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:05:54,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 07:05:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:07,577 INFO L225 Difference]: With dead ends: 1189654 [2019-09-10 07:06:07,578 INFO L226 Difference]: Without dead ends: 1189654 [2019-09-10 07:06:07,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189654 states. [2019-09-10 07:06:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189654 to 550013. [2019-09-10 07:06:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550013 states. [2019-09-10 07:06:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550013 states to 550013 states and 734104 transitions. [2019-09-10 07:06:20,688 INFO L78 Accepts]: Start accepts. Automaton has 550013 states and 734104 transitions. Word has length 94 [2019-09-10 07:06:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:20,688 INFO L475 AbstractCegarLoop]: Abstraction has 550013 states and 734104 transitions. [2019-09-10 07:06:20,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 550013 states and 734104 transitions. [2019-09-10 07:06:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:06:20,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:20,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] [2019-09-10 07:06:20,703 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:20,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash 19522476, now seen corresponding path program 1 times [2019-09-10 07:06:20,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:20,811 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 07:06:20,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:20,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:20,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:20,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:20,813 INFO L87 Difference]: Start difference. First operand 550013 states and 734104 transitions. Second operand 3 states. [2019-09-10 07:06:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:23,640 INFO L93 Difference]: Finished difference Result 549995 states and 726216 transitions. [2019-09-10 07:06:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:23,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:06:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:24,418 INFO L225 Difference]: With dead ends: 549995 [2019-09-10 07:06:24,418 INFO L226 Difference]: Without dead ends: 549995 [2019-09-10 07:06:24,418 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 07:06:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549995 states. [2019-09-10 07:06:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549995 to 478203. [2019-09-10 07:06:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478203 states. [2019-09-10 07:06:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478203 states to 478203 states and 632998 transitions. [2019-09-10 07:06:39,835 INFO L78 Accepts]: Start accepts. Automaton has 478203 states and 632998 transitions. Word has length 95 [2019-09-10 07:06:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:39,835 INFO L475 AbstractCegarLoop]: Abstraction has 478203 states and 632998 transitions. [2019-09-10 07:06:39,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 478203 states and 632998 transitions. [2019-09-10 07:06:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:06:39,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:39,848 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] [2019-09-10 07:06:39,848 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash 383548345, now seen corresponding path program 1 times [2019-09-10 07:06:39,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:39,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 07:06:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:39,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:39,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:39,966 INFO L87 Difference]: Start difference. First operand 478203 states and 632998 transitions. Second operand 5 states. [2019-09-10 07:06:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:50,020 INFO L93 Difference]: Finished difference Result 1070095 states and 1412012 transitions. [2019-09-10 07:06:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:06:50,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 07:06:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:51,568 INFO L225 Difference]: With dead ends: 1070095 [2019-09-10 07:06:51,568 INFO L226 Difference]: Without dead ends: 1070095 [2019-09-10 07:06:51,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070095 states. [2019-09-10 07:07:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070095 to 478175. [2019-09-10 07:07:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478175 states. [2019-09-10 07:07:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478175 states to 478175 states and 632958 transitions. [2019-09-10 07:07:09,059 INFO L78 Accepts]: Start accepts. Automaton has 478175 states and 632958 transitions. Word has length 95 [2019-09-10 07:07:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:09,059 INFO L475 AbstractCegarLoop]: Abstraction has 478175 states and 632958 transitions. [2019-09-10 07:07:09,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 478175 states and 632958 transitions. [2019-09-10 07:07:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:07:09,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:09,072 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] [2019-09-10 07:07:09,073 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1040044953, now seen corresponding path program 1 times [2019-09-10 07:07:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:09,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:09,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:09,184 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 07:07:09,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:09,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:09,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:09,185 INFO L87 Difference]: Start difference. First operand 478175 states and 632958 transitions. Second operand 5 states. [2019-09-10 07:07:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:19,596 INFO L93 Difference]: Finished difference Result 1053649 states and 1390402 transitions. [2019-09-10 07:07:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:07:19,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 07:07:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:22,333 INFO L225 Difference]: With dead ends: 1053649 [2019-09-10 07:07:22,333 INFO L226 Difference]: Without dead ends: 1053649 [2019-09-10 07:07:22,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053649 states. [2019-09-10 07:07:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053649 to 478147. [2019-09-10 07:07:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478147 states. [2019-09-10 07:07:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478147 states to 478147 states and 632918 transitions. [2019-09-10 07:07:40,317 INFO L78 Accepts]: Start accepts. Automaton has 478147 states and 632918 transitions. Word has length 95 [2019-09-10 07:07:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:40,317 INFO L475 AbstractCegarLoop]: Abstraction has 478147 states and 632918 transitions. [2019-09-10 07:07:40,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 478147 states and 632918 transitions. [2019-09-10 07:07:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:07:41,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:41,691 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] [2019-09-10 07:07:41,692 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1886906773, now seen corresponding path program 1 times [2019-09-10 07:07:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:41,815 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 07:07:41,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:41,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:41,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:41,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:41,818 INFO L87 Difference]: Start difference. First operand 478147 states and 632918 transitions. Second operand 5 states. [2019-09-10 07:07:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:48,137 INFO L93 Difference]: Finished difference Result 1196543 states and 1567185 transitions. [2019-09-10 07:07:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:07:48,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:07:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:01,396 INFO L225 Difference]: With dead ends: 1196543 [2019-09-10 07:08:01,396 INFO L226 Difference]: Without dead ends: 1196543 [2019-09-10 07:08:01,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196543 states. [2019-09-10 07:08:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196543 to 739566. [2019-09-10 07:08:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739566 states. [2019-09-10 07:08:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739566 states to 739566 states and 972839 transitions. [2019-09-10 07:08:27,560 INFO L78 Accepts]: Start accepts. Automaton has 739566 states and 972839 transitions. Word has length 97 [2019-09-10 07:08:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:27,560 INFO L475 AbstractCegarLoop]: Abstraction has 739566 states and 972839 transitions. [2019-09-10 07:08:27,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:08:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 739566 states and 972839 transitions. [2019-09-10 07:08:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:08:27,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:27,571 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] [2019-09-10 07:08:27,572 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1399928965, now seen corresponding path program 1 times [2019-09-10 07:08:27,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:27,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 07:08:27,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:27,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:08:27,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:27,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:08:27,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:08:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:08:27,722 INFO L87 Difference]: Start difference. First operand 739566 states and 972839 transitions. Second operand 5 states. [2019-09-10 07:08:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:44,159 INFO L93 Difference]: Finished difference Result 1854779 states and 2404001 transitions. [2019-09-10 07:08:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:08:44,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:08:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:48,206 INFO L225 Difference]: With dead ends: 1854779 [2019-09-10 07:08:48,207 INFO L226 Difference]: Without dead ends: 1854779 [2019-09-10 07:08:48,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854779 states. [2019-09-10 07:09:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854779 to 1256777. [2019-09-10 07:09:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256777 states. [2019-09-10 07:09:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256777 states to 1256777 states and 1647143 transitions. [2019-09-10 07:09:36,435 INFO L78 Accepts]: Start accepts. Automaton has 1256777 states and 1647143 transitions. Word has length 97 [2019-09-10 07:09:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:36,435 INFO L475 AbstractCegarLoop]: Abstraction has 1256777 states and 1647143 transitions. [2019-09-10 07:09:36,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1256777 states and 1647143 transitions. [2019-09-10 07:09:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:36,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:36,448 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] [2019-09-10 07:09:36,449 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -966627952, now seen corresponding path program 1 times [2019-09-10 07:09:36,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:36,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:36,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:36,629 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 07:09:36,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:36,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:36,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:36,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:36,631 INFO L87 Difference]: Start difference. First operand 1256777 states and 1647143 transitions. Second operand 7 states. [2019-09-10 07:09:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:56,729 INFO L93 Difference]: Finished difference Result 1784507 states and 2335438 transitions. [2019-09-10 07:09:56,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:56,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-09-10 07:09:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:00,602 INFO L225 Difference]: With dead ends: 1784507 [2019-09-10 07:10:00,603 INFO L226 Difference]: Without dead ends: 1784507 [2019-09-10 07:10:00,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:10:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784507 states. [2019-09-10 07:10:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784507 to 1735533. [2019-09-10 07:10:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735533 states.