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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:54:05,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:54:05,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:54:05,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:54:05,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:54:05,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:54:05,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:54:05,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:54:05,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:54:05,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:54:05,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:54:05,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:54:05,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:54:05,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:54:05,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:54:05,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:54:05,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:54:05,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:54:05,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:54:05,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:54:05,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:54:05,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:54:05,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:54:05,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:54:05,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:54:05,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:54:05,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:54:05,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:54:05,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:54:05,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:54:05,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:54:05,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:54:05,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:54:05,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:54:05,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:54:05,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:54:05,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:54:05,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:54:05,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:54:05,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:54:05,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:54:05,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:54:05,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:54:05,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:54:05,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:54:05,813 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:54:05,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:54:05,814 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:54:05,814 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:54:05,814 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:54:05,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:54:05,815 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:54:05,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:54:05,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:54:05,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:54:05,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:54:05,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:54:05,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:54:05,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:54:05,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:54:05,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:54:05,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:54:05,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:54:05,818 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:54:05,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:54:05,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:54:05,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:54:05,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:54:05,819 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:54:05,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:54:05,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:54:05,819 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:54:05,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:54:05,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:54:05,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:54:05,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:54:05,869 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:54:05,869 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:54:05,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897a17355/a9b03e47fbeb4e99a39705f5502a5a32/FLAG7e744944c [2019-09-10 06:54:06,809 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:54:06,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:54:06,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897a17355/a9b03e47fbeb4e99a39705f5502a5a32/FLAG7e744944c [2019-09-10 06:54:07,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897a17355/a9b03e47fbeb4e99a39705f5502a5a32 [2019-09-10 06:54:07,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:54:07,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:54:07,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:54:07,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:54:07,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:54:07,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:54:07" (1/1) ... [2019-09-10 06:54:07,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bec8495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:07, skipping insertion in model container [2019-09-10 06:54:07,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:54:07" (1/1) ... [2019-09-10 06:54:07,315 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:54:07,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:54:09,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:54:09,558 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:54:10,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:54:10,559 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:54:10,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10 WrapperNode [2019-09-10 06:54:10,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:54:10,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:54:10,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:54:10,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:54:10,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... [2019-09-10 06:54:10,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:54:10,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:54:10,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:54:10,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:54:10,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:54:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:54:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:54:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:54:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:54:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:54:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:54:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:54:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:54:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:54:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:54:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:54:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:54:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:54:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:54:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:54:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:54:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:54:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:54:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:54:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:54:19,478 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:54:19,478 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:54:19,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:54:19 BoogieIcfgContainer [2019-09-10 06:54:19,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:54:19,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:54:19,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:54:19,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:54:19,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:54:07" (1/3) ... [2019-09-10 06:54:19,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfc1c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:54:19, skipping insertion in model container [2019-09-10 06:54:19,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:10" (2/3) ... [2019-09-10 06:54:19,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfc1c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:54:19, skipping insertion in model container [2019-09-10 06:54:19,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:54:19" (3/3) ... [2019-09-10 06:54:19,492 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:54:19,505 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:54:19,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-10 06:54:19,537 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-10 06:54:19,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:54:19,569 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:54:19,570 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:54:19,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:54:19,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:54:19,570 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:54:19,570 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:54:19,570 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:54:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states. [2019-09-10 06:54:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:54:19,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:19,685 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] [2019-09-10 06:54:19,687 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1063639787, now seen corresponding path program 1 times [2019-09-10 06:54:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:19,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:19,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:20,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:54:20,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:20,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:54:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:54:20,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:54:20,538 INFO L87 Difference]: Start difference. First operand 3537 states. Second operand 5 states. [2019-09-10 06:54:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:26,433 INFO L93 Difference]: Finished difference Result 4245 states and 7423 transitions. [2019-09-10 06:54:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:26,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:54:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:26,479 INFO L225 Difference]: With dead ends: 4245 [2019-09-10 06:54:26,479 INFO L226 Difference]: Without dead ends: 4233 [2019-09-10 06:54:26,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:54:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-09-10 06:54:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4209. [2019-09-10 06:54:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4209 states. [2019-09-10 06:54:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4209 states to 4209 states and 5610 transitions. [2019-09-10 06:54:26,683 INFO L78 Accepts]: Start accepts. Automaton has 4209 states and 5610 transitions. Word has length 68 [2019-09-10 06:54:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:26,684 INFO L475 AbstractCegarLoop]: Abstraction has 4209 states and 5610 transitions. [2019-09-10 06:54:26,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:54:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4209 states and 5610 transitions. [2019-09-10 06:54:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:54:26,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:26,696 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 06:54:26,697 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1562022184, now seen corresponding path program 1 times [2019-09-10 06:54:26,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:26,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:26,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:26,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:26,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:26,971 INFO L87 Difference]: Start difference. First operand 4209 states and 5610 transitions. Second operand 6 states. [2019-09-10 06:54:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:30,515 INFO L93 Difference]: Finished difference Result 6014 states and 8105 transitions. [2019-09-10 06:54:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:30,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:54:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:30,557 INFO L225 Difference]: With dead ends: 6014 [2019-09-10 06:54:30,557 INFO L226 Difference]: Without dead ends: 6014 [2019-09-10 06:54:30,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:54:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2019-09-10 06:54:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5973. [2019-09-10 06:54:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5973 states. [2019-09-10 06:54:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 8078 transitions. [2019-09-10 06:54:30,788 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 8078 transitions. Word has length 69 [2019-09-10 06:54:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:30,789 INFO L475 AbstractCegarLoop]: Abstraction has 5973 states and 8078 transitions. [2019-09-10 06:54:30,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 8078 transitions. [2019-09-10 06:54:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:54:30,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:30,804 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 06:54:30,805 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1710248159, now seen corresponding path program 1 times [2019-09-10 06:54:30,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:30,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:30,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:31,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:31,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:31,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:31,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:31,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:31,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:31,087 INFO L87 Difference]: Start difference. First operand 5973 states and 8078 transitions. Second operand 6 states. [2019-09-10 06:54:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:34,416 INFO L93 Difference]: Finished difference Result 9019 states and 12242 transitions. [2019-09-10 06:54:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:34,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:54:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:34,461 INFO L225 Difference]: With dead ends: 9019 [2019-09-10 06:54:34,461 INFO L226 Difference]: Without dead ends: 9019 [2019-09-10 06:54:34,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:54:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2019-09-10 06:54:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 8987. [2019-09-10 06:54:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8987 states. [2019-09-10 06:54:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8987 states to 8987 states and 12224 transitions. [2019-09-10 06:54:34,727 INFO L78 Accepts]: Start accepts. Automaton has 8987 states and 12224 transitions. Word has length 69 [2019-09-10 06:54:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:34,728 INFO L475 AbstractCegarLoop]: Abstraction has 8987 states and 12224 transitions. [2019-09-10 06:54:34,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8987 states and 12224 transitions. [2019-09-10 06:54:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:54:34,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:34,743 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 06:54:34,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash -20519424, now seen corresponding path program 1 times [2019-09-10 06:54:34,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:34,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:34,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:34,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:34,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:35,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:35,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:54:35,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:35,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:54:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:54:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:54:35,230 INFO L87 Difference]: Start difference. First operand 8987 states and 12224 transitions. Second operand 8 states. [2019-09-10 06:54:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:41,075 INFO L93 Difference]: Finished difference Result 13937 states and 19964 transitions. [2019-09-10 06:54:41,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:54:41,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-10 06:54:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:41,126 INFO L225 Difference]: With dead ends: 13937 [2019-09-10 06:54:41,126 INFO L226 Difference]: Without dead ends: 13937 [2019-09-10 06:54:41,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:54:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2019-09-10 06:54:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 8881. [2019-09-10 06:54:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2019-09-10 06:54:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 12073 transitions. [2019-09-10 06:54:41,346 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 12073 transitions. Word has length 70 [2019-09-10 06:54:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:41,348 INFO L475 AbstractCegarLoop]: Abstraction has 8881 states and 12073 transitions. [2019-09-10 06:54:41,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:54:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 12073 transitions. [2019-09-10 06:54:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:54:41,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:41,364 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 06:54:41,365 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1266244003, now seen corresponding path program 1 times [2019-09-10 06:54:41,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:41,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:41,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:41,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:41,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:41,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:41,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:41,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:41,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:41,529 INFO L87 Difference]: Start difference. First operand 8881 states and 12073 transitions. Second operand 6 states. [2019-09-10 06:54:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:43,884 INFO L93 Difference]: Finished difference Result 14486 states and 20066 transitions. [2019-09-10 06:54:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:43,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:54:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:43,919 INFO L225 Difference]: With dead ends: 14486 [2019-09-10 06:54:43,919 INFO L226 Difference]: Without dead ends: 14486 [2019-09-10 06:54:43,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:54:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14486 states. [2019-09-10 06:54:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14486 to 14441. [2019-09-10 06:54:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14441 states. [2019-09-10 06:54:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14441 states to 14441 states and 20034 transitions. [2019-09-10 06:54:44,264 INFO L78 Accepts]: Start accepts. Automaton has 14441 states and 20034 transitions. Word has length 70 [2019-09-10 06:54:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:44,265 INFO L475 AbstractCegarLoop]: Abstraction has 14441 states and 20034 transitions. [2019-09-10 06:54:44,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 14441 states and 20034 transitions. [2019-09-10 06:54:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:54:44,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:44,278 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 06:54:44,279 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 451335994, now seen corresponding path program 1 times [2019-09-10 06:54:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:44,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:44,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:54:44,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:44,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:54:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:54:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:54:44,531 INFO L87 Difference]: Start difference. First operand 14441 states and 20034 transitions. Second operand 9 states. [2019-09-10 06:54:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:53,327 INFO L93 Difference]: Finished difference Result 40572 states and 58671 transitions. [2019-09-10 06:54:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:54:53,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 06:54:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:53,422 INFO L225 Difference]: With dead ends: 40572 [2019-09-10 06:54:53,422 INFO L226 Difference]: Without dead ends: 40572 [2019-09-10 06:54:53,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:54:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40572 states. [2019-09-10 06:54:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40572 to 14359. [2019-09-10 06:54:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14359 states. [2019-09-10 06:54:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14359 states to 14359 states and 19917 transitions. [2019-09-10 06:54:54,079 INFO L78 Accepts]: Start accepts. Automaton has 14359 states and 19917 transitions. Word has length 70 [2019-09-10 06:54:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:54,080 INFO L475 AbstractCegarLoop]: Abstraction has 14359 states and 19917 transitions. [2019-09-10 06:54:54,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:54:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14359 states and 19917 transitions. [2019-09-10 06:54:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:54:54,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:54,106 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 06:54:54,106 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash 870882905, now seen corresponding path program 1 times [2019-09-10 06:54:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:54,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:54,524 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-09-10 06:54:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:54,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:54:54,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:54,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:54:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:54:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:54:54,733 INFO L87 Difference]: Start difference. First operand 14359 states and 19917 transitions. Second operand 12 states. [2019-09-10 06:54:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:59,243 INFO L93 Difference]: Finished difference Result 56897 states and 85764 transitions. [2019-09-10 06:54:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:54:59,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 06:54:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:59,349 INFO L225 Difference]: With dead ends: 56897 [2019-09-10 06:54:59,349 INFO L226 Difference]: Without dead ends: 56897 [2019-09-10 06:54:59,350 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 06:54:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56897 states. [2019-09-10 06:55:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56897 to 14273. [2019-09-10 06:55:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-10 06:55:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19791 transitions. [2019-09-10 06:55:00,044 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19791 transitions. Word has length 71 [2019-09-10 06:55:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:00,045 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19791 transitions. [2019-09-10 06:55:00,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19791 transitions. [2019-09-10 06:55:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:55:00,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:00,055 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 06:55:00,056 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash 350453109, now seen corresponding path program 1 times [2019-09-10 06:55:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:00,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:00,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:00,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:00,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:00,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:00,299 INFO L87 Difference]: Start difference. First operand 14273 states and 19791 transitions. Second operand 9 states. [2019-09-10 06:55:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:05,607 INFO L93 Difference]: Finished difference Result 19654 states and 28079 transitions. [2019-09-10 06:55:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:55:05,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 06:55:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:05,636 INFO L225 Difference]: With dead ends: 19654 [2019-09-10 06:55:05,637 INFO L226 Difference]: Without dead ends: 19654 [2019-09-10 06:55:05,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:55:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-09-10 06:55:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 14273. [2019-09-10 06:55:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-10 06:55:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19790 transitions. [2019-09-10 06:55:06,038 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19790 transitions. Word has length 71 [2019-09-10 06:55:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:06,038 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19790 transitions. [2019-09-10 06:55:06,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:55:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19790 transitions. [2019-09-10 06:55:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:55:06,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:06,050 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 06:55:06,050 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2100398418, now seen corresponding path program 1 times [2019-09-10 06:55:06,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:06,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:06,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:06,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:06,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:06,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:06,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:06,285 INFO L87 Difference]: Start difference. First operand 14273 states and 19790 transitions. Second operand 9 states. [2019-09-10 06:55:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:13,150 INFO L93 Difference]: Finished difference Result 22664 states and 32428 transitions. [2019-09-10 06:55:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:55:13,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 06:55:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:13,173 INFO L225 Difference]: With dead ends: 22664 [2019-09-10 06:55:13,173 INFO L226 Difference]: Without dead ends: 22664 [2019-09-10 06:55:13,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:55:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22664 states. [2019-09-10 06:55:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22664 to 14273. [2019-09-10 06:55:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-10 06:55:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19789 transitions. [2019-09-10 06:55:13,408 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19789 transitions. Word has length 71 [2019-09-10 06:55:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:13,409 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19789 transitions. [2019-09-10 06:55:13,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:55:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19789 transitions. [2019-09-10 06:55:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:55:13,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:13,419 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 06:55:13,419 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 343354784, now seen corresponding path program 1 times [2019-09-10 06:55:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:13,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:13,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:55:13,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:13,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:55:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:55:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:55:13,959 INFO L87 Difference]: Start difference. First operand 14273 states and 19789 transitions. Second operand 11 states. [2019-09-10 06:55:14,563 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:55:15,138 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:55:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:22,592 INFO L93 Difference]: Finished difference Result 97036 states and 147929 transitions. [2019-09-10 06:55:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:55:22,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-10 06:55:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:22,698 INFO L225 Difference]: With dead ends: 97036 [2019-09-10 06:55:22,698 INFO L226 Difference]: Without dead ends: 97036 [2019-09-10 06:55:22,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=538, Invalid=1624, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:55:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97036 states. [2019-09-10 06:55:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97036 to 14184. [2019-09-10 06:55:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14184 states. [2019-09-10 06:55:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14184 states to 14184 states and 19666 transitions. [2019-09-10 06:55:23,229 INFO L78 Accepts]: Start accepts. Automaton has 14184 states and 19666 transitions. Word has length 71 [2019-09-10 06:55:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:23,229 INFO L475 AbstractCegarLoop]: Abstraction has 14184 states and 19666 transitions. [2019-09-10 06:55:23,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:55:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14184 states and 19666 transitions. [2019-09-10 06:55:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:23,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:23,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] [2019-09-10 06:55:23,239 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1658925808, now seen corresponding path program 1 times [2019-09-10 06:55:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:23,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:23,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:23,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:55:23,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:23,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:55:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:55:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:55:23,770 INFO L87 Difference]: Start difference. First operand 14184 states and 19666 transitions. Second operand 12 states. [2019-09-10 06:55:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:28,024 INFO L93 Difference]: Finished difference Result 56838 states and 85692 transitions. [2019-09-10 06:55:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:55:28,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-10 06:55:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:28,087 INFO L225 Difference]: With dead ends: 56838 [2019-09-10 06:55:28,087 INFO L226 Difference]: Without dead ends: 56838 [2019-09-10 06:55:28,088 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 06:55:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56838 states. [2019-09-10 06:55:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56838 to 14176. [2019-09-10 06:55:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-10 06:55:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19657 transitions. [2019-09-10 06:55:28,449 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19657 transitions. Word has length 72 [2019-09-10 06:55:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:28,449 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19657 transitions. [2019-09-10 06:55:28,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19657 transitions. [2019-09-10 06:55:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:28,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:28,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:28,459 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1364499548, now seen corresponding path program 1 times [2019-09-10 06:55:28,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:28,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:28,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:28,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:28,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:28,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:28,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:28,640 INFO L87 Difference]: Start difference. First operand 14176 states and 19657 transitions. Second operand 9 states. [2019-09-10 06:55:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:36,580 INFO L93 Difference]: Finished difference Result 40351 states and 58371 transitions. [2019-09-10 06:55:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:55:36,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:55:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:36,629 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 06:55:36,629 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 06:55:36,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:55:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 06:55:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 14176. [2019-09-10 06:55:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-10 06:55:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19656 transitions. [2019-09-10 06:55:36,993 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19656 transitions. Word has length 72 [2019-09-10 06:55:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:36,993 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19656 transitions. [2019-09-10 06:55:36,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:55:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19656 transitions. [2019-09-10 06:55:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:37,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:37,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:37,001 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash -313639877, now seen corresponding path program 1 times [2019-09-10 06:55:37,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:37,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:37,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:37,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:37,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:37,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:37,204 INFO L87 Difference]: Start difference. First operand 14176 states and 19656 transitions. Second operand 9 states. [2019-09-10 06:55:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:43,488 INFO L93 Difference]: Finished difference Result 31900 states and 46760 transitions. [2019-09-10 06:55:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:55:43,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:55:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:43,523 INFO L225 Difference]: With dead ends: 31900 [2019-09-10 06:55:43,523 INFO L226 Difference]: Without dead ends: 31900 [2019-09-10 06:55:43,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:55:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31900 states. [2019-09-10 06:55:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31900 to 14176. [2019-09-10 06:55:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-10 06:55:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19655 transitions. [2019-09-10 06:55:43,743 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19655 transitions. Word has length 72 [2019-09-10 06:55:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:43,744 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19655 transitions. [2019-09-10 06:55:43,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:55:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19655 transitions. [2019-09-10 06:55:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:43,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:43,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:43,753 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1017120245, now seen corresponding path program 1 times [2019-09-10 06:55:43,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:43,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:43,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:43,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:55:43,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:43,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:55:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:55:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:55:43,936 INFO L87 Difference]: Start difference. First operand 14176 states and 19655 transitions. Second operand 8 states. [2019-09-10 06:55:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:48,157 INFO L93 Difference]: Finished difference Result 33939 states and 50437 transitions. [2019-09-10 06:55:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:55:48,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 06:55:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:48,195 INFO L225 Difference]: With dead ends: 33939 [2019-09-10 06:55:48,195 INFO L226 Difference]: Without dead ends: 33939 [2019-09-10 06:55:48,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:55:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33939 states. [2019-09-10 06:55:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33939 to 14176. [2019-09-10 06:55:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-10 06:55:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19654 transitions. [2019-09-10 06:55:48,435 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19654 transitions. Word has length 72 [2019-09-10 06:55:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:48,435 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19654 transitions. [2019-09-10 06:55:48,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:55:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19654 transitions. [2019-09-10 06:55:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:48,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:48,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:48,446 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 98934365, now seen corresponding path program 1 times [2019-09-10 06:55:48,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:48,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:48,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:48,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:55:48,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:48,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:55:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:55:48,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:55:48,833 INFO L87 Difference]: Start difference. First operand 14176 states and 19654 transitions. Second operand 11 states. [2019-09-10 06:55:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:53,387 INFO L93 Difference]: Finished difference Result 62418 states and 94471 transitions. [2019-09-10 06:55:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:55:53,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 06:55:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:53,449 INFO L225 Difference]: With dead ends: 62418 [2019-09-10 06:55:53,449 INFO L226 Difference]: Without dead ends: 62418 [2019-09-10 06:55:53,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:55:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62418 states. [2019-09-10 06:55:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62418 to 14133. [2019-09-10 06:55:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14133 states. [2019-09-10 06:55:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14133 states to 14133 states and 19603 transitions. [2019-09-10 06:55:53,773 INFO L78 Accepts]: Start accepts. Automaton has 14133 states and 19603 transitions. Word has length 72 [2019-09-10 06:55:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:53,774 INFO L475 AbstractCegarLoop]: Abstraction has 14133 states and 19603 transitions. [2019-09-10 06:55:53,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:55:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14133 states and 19603 transitions. [2019-09-10 06:55:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:53,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:53,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:53,780 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash 997156317, now seen corresponding path program 1 times [2019-09-10 06:55:53,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:53,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:53,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:53,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:53,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:53,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:53,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:53,873 INFO L87 Difference]: Start difference. First operand 14133 states and 19603 transitions. Second operand 3 states. [2019-09-10 06:55:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:54,033 INFO L93 Difference]: Finished difference Result 13403 states and 19134 transitions. [2019-09-10 06:55:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:54,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 06:55:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:54,050 INFO L225 Difference]: With dead ends: 13403 [2019-09-10 06:55:54,051 INFO L226 Difference]: Without dead ends: 13403 [2019-09-10 06:55:54,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13403 states. [2019-09-10 06:55:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13403 to 13385. [2019-09-10 06:55:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13385 states. [2019-09-10 06:55:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13385 states to 13385 states and 19122 transitions. [2019-09-10 06:55:54,246 INFO L78 Accepts]: Start accepts. Automaton has 13385 states and 19122 transitions. Word has length 72 [2019-09-10 06:55:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:54,247 INFO L475 AbstractCegarLoop]: Abstraction has 13385 states and 19122 transitions. [2019-09-10 06:55:54,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 13385 states and 19122 transitions. [2019-09-10 06:55:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:55:54,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:54,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:54,256 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2144380542, now seen corresponding path program 1 times [2019-09-10 06:55:54,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:54,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:54,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:54,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:54,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:54,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:54,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:54,367 INFO L87 Difference]: Start difference. First operand 13385 states and 19122 transitions. Second operand 3 states. [2019-09-10 06:55:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:54,540 INFO L93 Difference]: Finished difference Result 21011 states and 30250 transitions. [2019-09-10 06:55:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:54,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:55:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:54,569 INFO L225 Difference]: With dead ends: 21011 [2019-09-10 06:55:54,569 INFO L226 Difference]: Without dead ends: 21011 [2019-09-10 06:55:54,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21011 states. [2019-09-10 06:55:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21011 to 18868. [2019-09-10 06:55:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18868 states. [2019-09-10 06:55:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 26978 transitions. [2019-09-10 06:55:54,766 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 26978 transitions. Word has length 73 [2019-09-10 06:55:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:54,766 INFO L475 AbstractCegarLoop]: Abstraction has 18868 states and 26978 transitions. [2019-09-10 06:55:54,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 26978 transitions. [2019-09-10 06:55:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:55:54,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:54,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:54,772 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1936130210, now seen corresponding path program 1 times [2019-09-10 06:55:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:54,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:54,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:54,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:54,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:54,865 INFO L87 Difference]: Start difference. First operand 18868 states and 26978 transitions. Second operand 3 states. [2019-09-10 06:55:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:55,001 INFO L93 Difference]: Finished difference Result 26635 states and 38939 transitions. [2019-09-10 06:55:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:55,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:55:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:55,034 INFO L225 Difference]: With dead ends: 26635 [2019-09-10 06:55:55,034 INFO L226 Difference]: Without dead ends: 26635 [2019-09-10 06:55:55,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26635 states. [2019-09-10 06:55:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26635 to 20603. [2019-09-10 06:55:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20603 states. [2019-09-10 06:55:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 29770 transitions. [2019-09-10 06:55:55,285 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 29770 transitions. Word has length 73 [2019-09-10 06:55:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:55,285 INFO L475 AbstractCegarLoop]: Abstraction has 20603 states and 29770 transitions. [2019-09-10 06:55:55,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 29770 transitions. [2019-09-10 06:55:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:55:55,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:55,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:55,290 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:55,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2045368516, now seen corresponding path program 1 times [2019-09-10 06:55:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:55,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:55,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:55,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:55,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:55,386 INFO L87 Difference]: Start difference. First operand 20603 states and 29770 transitions. Second operand 3 states. [2019-09-10 06:55:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:55,656 INFO L93 Difference]: Finished difference Result 33804 states and 48562 transitions. [2019-09-10 06:55:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:55,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:55:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:55,699 INFO L225 Difference]: With dead ends: 33804 [2019-09-10 06:55:55,699 INFO L226 Difference]: Without dead ends: 33804 [2019-09-10 06:55:55,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33804 states. [2019-09-10 06:55:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33804 to 33796. [2019-09-10 06:55:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33796 states. [2019-09-10 06:55:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33796 states to 33796 states and 48558 transitions. [2019-09-10 06:55:56,158 INFO L78 Accepts]: Start accepts. Automaton has 33796 states and 48558 transitions. Word has length 73 [2019-09-10 06:55:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:56,158 INFO L475 AbstractCegarLoop]: Abstraction has 33796 states and 48558 transitions. [2019-09-10 06:55:56,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33796 states and 48558 transitions. [2019-09-10 06:55:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:55:56,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:56,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:56,166 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash 466736798, now seen corresponding path program 1 times [2019-09-10 06:55:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:56,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:56,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:56,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:56,250 INFO L87 Difference]: Start difference. First operand 33796 states and 48558 transitions. Second operand 3 states. [2019-09-10 06:55:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:56,544 INFO L93 Difference]: Finished difference Result 46579 states and 68316 transitions. [2019-09-10 06:55:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:56,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:55:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:56,617 INFO L225 Difference]: With dead ends: 46579 [2019-09-10 06:55:56,617 INFO L226 Difference]: Without dead ends: 46579 [2019-09-10 06:55:56,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46579 states. [2019-09-10 06:55:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46579 to 46571. [2019-09-10 06:55:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46571 states. [2019-09-10 06:55:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46571 states to 46571 states and 68312 transitions. [2019-09-10 06:55:57,204 INFO L78 Accepts]: Start accepts. Automaton has 46571 states and 68312 transitions. Word has length 73 [2019-09-10 06:55:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:57,204 INFO L475 AbstractCegarLoop]: Abstraction has 46571 states and 68312 transitions. [2019-09-10 06:55:57,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 46571 states and 68312 transitions. [2019-09-10 06:55:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:55:57,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:57,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] [2019-09-10 06:55:57,213 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1267420457, now seen corresponding path program 1 times [2019-09-10 06:55:57,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:57,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:57,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:57,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:57,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:57,311 INFO L87 Difference]: Start difference. First operand 46571 states and 68312 transitions. Second operand 3 states. [2019-09-10 06:55:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:57,609 INFO L93 Difference]: Finished difference Result 53878 states and 79487 transitions. [2019-09-10 06:55:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:57,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:55:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:57,670 INFO L225 Difference]: With dead ends: 53878 [2019-09-10 06:55:57,670 INFO L226 Difference]: Without dead ends: 53878 [2019-09-10 06:55:57,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53878 states. [2019-09-10 06:55:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53878 to 43486. [2019-09-10 06:55:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43486 states. [2019-09-10 06:55:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43486 states to 43486 states and 64192 transitions. [2019-09-10 06:55:58,102 INFO L78 Accepts]: Start accepts. Automaton has 43486 states and 64192 transitions. Word has length 74 [2019-09-10 06:55:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:58,102 INFO L475 AbstractCegarLoop]: Abstraction has 43486 states and 64192 transitions. [2019-09-10 06:55:58,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 43486 states and 64192 transitions. [2019-09-10 06:55:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:55:58,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:58,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:58,107 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash -993095660, now seen corresponding path program 1 times [2019-09-10 06:55:58,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:58,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:58,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:58,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:58,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:58,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:58,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:58,188 INFO L87 Difference]: Start difference. First operand 43486 states and 64192 transitions. Second operand 3 states. [2019-09-10 06:55:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:59,844 INFO L93 Difference]: Finished difference Result 72833 states and 108644 transitions. [2019-09-10 06:55:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:59,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:55:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:59,922 INFO L225 Difference]: With dead ends: 72833 [2019-09-10 06:55:59,922 INFO L226 Difference]: Without dead ends: 72833 [2019-09-10 06:55:59,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72833 states. [2019-09-10 06:56:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72833 to 56437. [2019-09-10 06:56:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84111 transitions. [2019-09-10 06:56:00,541 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84111 transitions. Word has length 74 [2019-09-10 06:56:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:00,542 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84111 transitions. [2019-09-10 06:56:00,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84111 transitions. [2019-09-10 06:56:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:00,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:00,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:00,545 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1708157951, now seen corresponding path program 1 times [2019-09-10 06:56:00,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:00,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:00,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:00,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:00,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:00,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:00,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:00,733 INFO L87 Difference]: Start difference. First operand 56437 states and 84111 transitions. Second operand 9 states. [2019-09-10 06:56:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:03,874 INFO L93 Difference]: Finished difference Result 134203 states and 200226 transitions. [2019-09-10 06:56:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:56:03,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:04,049 INFO L225 Difference]: With dead ends: 134203 [2019-09-10 06:56:04,049 INFO L226 Difference]: Without dead ends: 134203 [2019-09-10 06:56:04,050 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 06:56:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134203 states. [2019-09-10 06:56:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134203 to 56437. [2019-09-10 06:56:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84109 transitions. [2019-09-10 06:56:06,837 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84109 transitions. Word has length 75 [2019-09-10 06:56:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:06,837 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84109 transitions. [2019-09-10 06:56:06,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84109 transitions. [2019-09-10 06:56:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:06,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:06,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:06,841 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash -592179090, now seen corresponding path program 1 times [2019-09-10 06:56:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:07,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:07,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:07,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:07,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:07,016 INFO L87 Difference]: Start difference. First operand 56437 states and 84109 transitions. Second operand 9 states. [2019-09-10 06:56:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:10,059 INFO L93 Difference]: Finished difference Result 101126 states and 150429 transitions. [2019-09-10 06:56:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:56:10,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:10,183 INFO L225 Difference]: With dead ends: 101126 [2019-09-10 06:56:10,184 INFO L226 Difference]: Without dead ends: 101126 [2019-09-10 06:56:10,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:56:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101126 states. [2019-09-10 06:56:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101126 to 56437. [2019-09-10 06:56:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84107 transitions. [2019-09-10 06:56:11,468 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84107 transitions. Word has length 75 [2019-09-10 06:56:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:11,468 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84107 transitions. [2019-09-10 06:56:11,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84107 transitions. [2019-09-10 06:56:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:11,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:11,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:11,471 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 129580343, now seen corresponding path program 1 times [2019-09-10 06:56:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:11,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:11,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:11,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:11,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:11,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:11,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:11,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:11,620 INFO L87 Difference]: Start difference. First operand 56437 states and 84107 transitions. Second operand 9 states. [2019-09-10 06:56:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:15,794 INFO L93 Difference]: Finished difference Result 162220 states and 240377 transitions. [2019-09-10 06:56:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:56:15,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:16,071 INFO L225 Difference]: With dead ends: 162220 [2019-09-10 06:56:16,071 INFO L226 Difference]: Without dead ends: 162220 [2019-09-10 06:56:16,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:56:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162220 states. [2019-09-10 06:56:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162220 to 56437. [2019-09-10 06:56:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84105 transitions. [2019-09-10 06:56:19,560 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84105 transitions. Word has length 75 [2019-09-10 06:56:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:19,561 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84105 transitions. [2019-09-10 06:56:19,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84105 transitions. [2019-09-10 06:56:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:19,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:19,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:19,564 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:19,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1422892121, now seen corresponding path program 1 times [2019-09-10 06:56:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:19,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:19,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:19,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:19,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 06:56:19,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:19,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:19,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:19,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:19,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:19,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:19,727 INFO L87 Difference]: Start difference. First operand 56437 states and 84105 transitions. Second operand 9 states. [2019-09-10 06:56:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:22,876 INFO L93 Difference]: Finished difference Result 101101 states and 150399 transitions. [2019-09-10 06:56:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:56:22,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:23,005 INFO L225 Difference]: With dead ends: 101101 [2019-09-10 06:56:23,006 INFO L226 Difference]: Without dead ends: 101101 [2019-09-10 06:56:23,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:56:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101101 states. [2019-09-10 06:56:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101101 to 56437. [2019-09-10 06:56:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84103 transitions. [2019-09-10 06:56:23,871 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84103 transitions. Word has length 75 [2019-09-10 06:56:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:23,872 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84103 transitions. [2019-09-10 06:56:23,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84103 transitions. [2019-09-10 06:56:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:23,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:23,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:23,876 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:23,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1817625223, now seen corresponding path program 1 times [2019-09-10 06:56:23,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:23,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:23,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:24,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:24,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:24,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:24,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:24,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:24,061 INFO L87 Difference]: Start difference. First operand 56437 states and 84103 transitions. Second operand 9 states. [2019-09-10 06:56:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:27,393 INFO L93 Difference]: Finished difference Result 101101 states and 150397 transitions. [2019-09-10 06:56:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:56:27,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:27,530 INFO L225 Difference]: With dead ends: 101101 [2019-09-10 06:56:27,530 INFO L226 Difference]: Without dead ends: 101101 [2019-09-10 06:56:27,531 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 06:56:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101101 states. [2019-09-10 06:56:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101101 to 56437. [2019-09-10 06:56:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84101 transitions. [2019-09-10 06:56:28,392 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84101 transitions. Word has length 75 [2019-09-10 06:56:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:28,392 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84101 transitions. [2019-09-10 06:56:28,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84101 transitions. [2019-09-10 06:56:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:56:28,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:28,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:28,396 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash -182574823, now seen corresponding path program 1 times [2019-09-10 06:56:28,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:28,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:28,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:28,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:28,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:28,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:28,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:28,562 INFO L87 Difference]: Start difference. First operand 56437 states and 84101 transitions. Second operand 9 states. [2019-09-10 06:56:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:31,801 INFO L93 Difference]: Finished difference Result 101126 states and 150421 transitions. [2019-09-10 06:56:31,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:56:31,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:31,948 INFO L225 Difference]: With dead ends: 101126 [2019-09-10 06:56:31,949 INFO L226 Difference]: Without dead ends: 101126 [2019-09-10 06:56:31,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:56:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101126 states. [2019-09-10 06:56:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101126 to 56437. [2019-09-10 06:56:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-10 06:56:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84099 transitions. [2019-09-10 06:56:33,267 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84099 transitions. Word has length 75 [2019-09-10 06:56:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:33,267 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84099 transitions. [2019-09-10 06:56:33,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84099 transitions. [2019-09-10 06:56:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:33,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:33,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:33,271 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:33,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:33,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1398382405, now seen corresponding path program 1 times [2019-09-10 06:56:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:33,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:33,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 06:56:33,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:33,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:33,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:33,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:33,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:33,351 INFO L87 Difference]: Start difference. First operand 56437 states and 84099 transitions. Second operand 3 states. [2019-09-10 06:56:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:33,713 INFO L93 Difference]: Finished difference Result 101987 states and 150793 transitions. [2019-09-10 06:56:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:33,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:56:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:33,853 INFO L225 Difference]: With dead ends: 101987 [2019-09-10 06:56:33,853 INFO L226 Difference]: Without dead ends: 101987 [2019-09-10 06:56:33,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101987 states. [2019-09-10 06:56:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101987 to 70667. [2019-09-10 06:56:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70667 states. [2019-09-10 06:56:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70667 states to 70667 states and 104396 transitions. [2019-09-10 06:56:34,710 INFO L78 Accepts]: Start accepts. Automaton has 70667 states and 104396 transitions. Word has length 76 [2019-09-10 06:56:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:34,710 INFO L475 AbstractCegarLoop]: Abstraction has 70667 states and 104396 transitions. [2019-09-10 06:56:34,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 70667 states and 104396 transitions. [2019-09-10 06:56:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:34,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:34,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:34,713 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 589063280, now seen corresponding path program 1 times [2019-09-10 06:56:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:34,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:34,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:34,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:34,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:34,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:34,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:34,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:34,871 INFO L87 Difference]: Start difference. First operand 70667 states and 104396 transitions. Second operand 9 states. [2019-09-10 06:56:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:38,194 INFO L93 Difference]: Finished difference Result 124388 states and 183259 transitions. [2019-09-10 06:56:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:56:38,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-10 06:56:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:38,393 INFO L225 Difference]: With dead ends: 124388 [2019-09-10 06:56:38,393 INFO L226 Difference]: Without dead ends: 124388 [2019-09-10 06:56:38,394 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 06:56:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124388 states. [2019-09-10 06:56:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124388 to 70662. [2019-09-10 06:56:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70662 states. [2019-09-10 06:56:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70662 states to 70662 states and 104387 transitions. [2019-09-10 06:56:39,578 INFO L78 Accepts]: Start accepts. Automaton has 70662 states and 104387 transitions. Word has length 76 [2019-09-10 06:56:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:39,579 INFO L475 AbstractCegarLoop]: Abstraction has 70662 states and 104387 transitions. [2019-09-10 06:56:39,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70662 states and 104387 transitions. [2019-09-10 06:56:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:39,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:39,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:39,583 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 543542166, now seen corresponding path program 1 times [2019-09-10 06:56:39,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:39,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:39,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:40,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:40,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:56:40,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:40,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:56:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:56:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:56:40,639 INFO L87 Difference]: Start difference. First operand 70662 states and 104387 transitions. Second operand 18 states. [2019-09-10 06:56:41,437 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 06:56:41,800 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 06:56:42,191 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:56:42,432 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:56:42,839 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:56:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:50,143 INFO L93 Difference]: Finished difference Result 111840 states and 164470 transitions. [2019-09-10 06:56:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:56:50,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-09-10 06:56:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:50,284 INFO L225 Difference]: With dead ends: 111840 [2019-09-10 06:56:50,285 INFO L226 Difference]: Without dead ends: 111840 [2019-09-10 06:56:50,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:56:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111840 states. [2019-09-10 06:56:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111840 to 70660. [2019-09-10 06:56:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70660 states. [2019-09-10 06:56:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70660 states to 70660 states and 104383 transitions. [2019-09-10 06:56:51,252 INFO L78 Accepts]: Start accepts. Automaton has 70660 states and 104383 transitions. Word has length 78 [2019-09-10 06:56:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:51,252 INFO L475 AbstractCegarLoop]: Abstraction has 70660 states and 104383 transitions. [2019-09-10 06:56:51,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:56:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70660 states and 104383 transitions. [2019-09-10 06:56:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:51,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:51,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:51,257 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1012544164, now seen corresponding path program 1 times [2019-09-10 06:56:51,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:51,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:51,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:52,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:52,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:56:52,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:52,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:56:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:56:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:56:52,008 INFO L87 Difference]: Start difference. First operand 70660 states and 104383 transitions. Second operand 17 states. [2019-09-10 06:56:52,659 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:56:55,186 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:56:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:56,984 INFO L93 Difference]: Finished difference Result 95930 states and 140105 transitions. [2019-09-10 06:56:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:56:56,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-09-10 06:56:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:57,112 INFO L225 Difference]: With dead ends: 95930 [2019-09-10 06:56:57,113 INFO L226 Difference]: Without dead ends: 95930 [2019-09-10 06:56:57,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:56:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95930 states. [2019-09-10 06:56:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95930 to 70586. [2019-09-10 06:56:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70586 states. [2019-09-10 06:56:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70586 states to 70586 states and 104284 transitions. [2019-09-10 06:56:58,062 INFO L78 Accepts]: Start accepts. Automaton has 70586 states and 104284 transitions. Word has length 78 [2019-09-10 06:56:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:58,063 INFO L475 AbstractCegarLoop]: Abstraction has 70586 states and 104284 transitions. [2019-09-10 06:56:58,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:56:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 70586 states and 104284 transitions. [2019-09-10 06:56:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:58,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:58,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:58,067 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash -65158486, now seen corresponding path program 1 times [2019-09-10 06:56:58,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:58,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:58,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:56:59,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:59,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:56:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:56:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:56:59,297 INFO L87 Difference]: Start difference. First operand 70586 states and 104284 transitions. Second operand 21 states. [2019-09-10 06:57:00,427 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:57:00,725 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:57:01,115 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 06:57:01,401 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:57:02,036 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:57:02,544 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:57:02,823 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:57:03,098 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:57:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:09,371 INFO L93 Difference]: Finished difference Result 134604 states and 199373 transitions. [2019-09-10 06:57:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:57:09,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2019-09-10 06:57:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:09,552 INFO L225 Difference]: With dead ends: 134604 [2019-09-10 06:57:09,552 INFO L226 Difference]: Without dead ends: 134604 [2019-09-10 06:57:09,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:57:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134604 states. [2019-09-10 06:57:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134604 to 70578. [2019-09-10 06:57:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70578 states. [2019-09-10 06:57:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70578 states to 70578 states and 104270 transitions. [2019-09-10 06:57:10,653 INFO L78 Accepts]: Start accepts. Automaton has 70578 states and 104270 transitions. Word has length 78 [2019-09-10 06:57:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:10,653 INFO L475 AbstractCegarLoop]: Abstraction has 70578 states and 104270 transitions. [2019-09-10 06:57:10,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:57:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 70578 states and 104270 transitions. [2019-09-10 06:57:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:57:10,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:10,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:10,658 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash 104506293, now seen corresponding path program 1 times [2019-09-10 06:57:10,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:10,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:10,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:10,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:10,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:11,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:11,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:57:11,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:11,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:57:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:57:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:57:11,551 INFO L87 Difference]: Start difference. First operand 70578 states and 104270 transitions. Second operand 18 states. [2019-09-10 06:57:12,333 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:57:12,711 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:57:13,030 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:57:13,194 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:57:13,436 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:57:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:17,909 INFO L93 Difference]: Finished difference Result 100856 states and 148269 transitions. [2019-09-10 06:57:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:57:17,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-09-10 06:57:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:18,053 INFO L225 Difference]: With dead ends: 100856 [2019-09-10 06:57:18,053 INFO L226 Difference]: Without dead ends: 100856 [2019-09-10 06:57:18,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:57:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100856 states. [2019-09-10 06:57:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100856 to 70542. [2019-09-10 06:57:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70542 states. [2019-09-10 06:57:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70542 states to 70542 states and 104221 transitions. [2019-09-10 06:57:18,933 INFO L78 Accepts]: Start accepts. Automaton has 70542 states and 104221 transitions. Word has length 78 [2019-09-10 06:57:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:18,933 INFO L475 AbstractCegarLoop]: Abstraction has 70542 states and 104221 transitions. [2019-09-10 06:57:18,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:57:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 70542 states and 104221 transitions. [2019-09-10 06:57:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:57:18,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:18,937 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 06:57:18,937 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1381605597, now seen corresponding path program 1 times [2019-09-10 06:57:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:19,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:57:19,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:19,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:57:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:57:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:57:19,345 INFO L87 Difference]: Start difference. First operand 70542 states and 104221 transitions. Second operand 11 states. [2019-09-10 06:57:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:21,295 INFO L93 Difference]: Finished difference Result 192101 states and 284375 transitions. [2019-09-10 06:57:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:57:21,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2019-09-10 06:57:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:21,511 INFO L225 Difference]: With dead ends: 192101 [2019-09-10 06:57:21,511 INFO L226 Difference]: Without dead ends: 192101 [2019-09-10 06:57:21,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:57:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192101 states. [2019-09-10 06:57:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192101 to 70474. [2019-09-10 06:57:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70474 states. [2019-09-10 06:57:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70474 states to 70474 states and 104136 transitions. [2019-09-10 06:57:23,439 INFO L78 Accepts]: Start accepts. Automaton has 70474 states and 104136 transitions. Word has length 79 [2019-09-10 06:57:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:23,439 INFO L475 AbstractCegarLoop]: Abstraction has 70474 states and 104136 transitions. [2019-09-10 06:57:23,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:57:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 70474 states and 104136 transitions. [2019-09-10 06:57:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:57:23,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:23,443 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 06:57:23,443 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1027193831, now seen corresponding path program 1 times [2019-09-10 06:57:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:23,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:23,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:57:23,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:23,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:57:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:57:23,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:57:23,839 INFO L87 Difference]: Start difference. First operand 70474 states and 104136 transitions. Second operand 12 states. [2019-09-10 06:57:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:26,012 INFO L93 Difference]: Finished difference Result 124444 states and 183664 transitions. [2019-09-10 06:57:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:57:26,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2019-09-10 06:57:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:26,144 INFO L225 Difference]: With dead ends: 124444 [2019-09-10 06:57:26,145 INFO L226 Difference]: Without dead ends: 124444 [2019-09-10 06:57:26,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:57:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124444 states. [2019-09-10 06:57:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124444 to 70468. [2019-09-10 06:57:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70468 states. [2019-09-10 06:57:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70468 states to 70468 states and 104127 transitions. [2019-09-10 06:57:27,694 INFO L78 Accepts]: Start accepts. Automaton has 70468 states and 104127 transitions. Word has length 79 [2019-09-10 06:57:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:27,694 INFO L475 AbstractCegarLoop]: Abstraction has 70468 states and 104127 transitions. [2019-09-10 06:57:27,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:57:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 70468 states and 104127 transitions. [2019-09-10 06:57:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:57:27,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:27,698 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 06:57:27,698 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 390723336, now seen corresponding path program 1 times [2019-09-10 06:57:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:27,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:28,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 06:57:28,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:28,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:57:28,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:28,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:57:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:57:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:57:28,277 INFO L87 Difference]: Start difference. First operand 70468 states and 104127 transitions. Second operand 14 states. [2019-09-10 06:57:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:31,658 INFO L93 Difference]: Finished difference Result 103740 states and 153127 transitions. [2019-09-10 06:57:31,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:57:31,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 79 [2019-09-10 06:57:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:31,798 INFO L225 Difference]: With dead ends: 103740 [2019-09-10 06:57:31,798 INFO L226 Difference]: Without dead ends: 103740 [2019-09-10 06:57:31,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:57:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103740 states. [2019-09-10 06:57:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103740 to 70467. [2019-09-10 06:57:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70467 states. [2019-09-10 06:57:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70467 states to 70467 states and 104124 transitions. [2019-09-10 06:57:32,767 INFO L78 Accepts]: Start accepts. Automaton has 70467 states and 104124 transitions. Word has length 79 [2019-09-10 06:57:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:32,767 INFO L475 AbstractCegarLoop]: Abstraction has 70467 states and 104124 transitions. [2019-09-10 06:57:32,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:57:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 70467 states and 104124 transitions. [2019-09-10 06:57:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:57:32,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:32,773 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 06:57:32,773 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash -941577444, now seen corresponding path program 1 times [2019-09-10 06:57:32,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:32,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:32,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:32,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:32,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:33,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:33,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:57:33,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:33,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:57:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:57:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:57:33,210 INFO L87 Difference]: Start difference. First operand 70467 states and 104124 transitions. Second operand 10 states. [2019-09-10 06:57:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:35,739 INFO L93 Difference]: Finished difference Result 183991 states and 271962 transitions. [2019-09-10 06:57:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:57:35,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-09-10 06:57:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:36,015 INFO L225 Difference]: With dead ends: 183991 [2019-09-10 06:57:36,015 INFO L226 Difference]: Without dead ends: 183991 [2019-09-10 06:57:36,016 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 06:57:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183991 states. [2019-09-10 06:57:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183991 to 70327. [2019-09-10 06:57:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70327 states. [2019-09-10 06:57:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70327 states to 70327 states and 103953 transitions. [2019-09-10 06:57:37,437 INFO L78 Accepts]: Start accepts. Automaton has 70327 states and 103953 transitions. Word has length 79 [2019-09-10 06:57:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:37,437 INFO L475 AbstractCegarLoop]: Abstraction has 70327 states and 103953 transitions. [2019-09-10 06:57:37,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:57:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70327 states and 103953 transitions. [2019-09-10 06:57:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:37,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:37,443 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] [2019-09-10 06:57:37,444 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash 296346175, now seen corresponding path program 1 times [2019-09-10 06:57:37,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:37,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:37,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:37,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:37,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:37,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:37,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:37,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:37,562 INFO L87 Difference]: Start difference. First operand 70327 states and 103953 transitions. Second operand 7 states. [2019-09-10 06:57:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:38,565 INFO L93 Difference]: Finished difference Result 316552 states and 457135 transitions. [2019-09-10 06:57:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:57:38,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 06:57:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:39,048 INFO L225 Difference]: With dead ends: 316552 [2019-09-10 06:57:39,049 INFO L226 Difference]: Without dead ends: 316552 [2019-09-10 06:57:39,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:57:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316552 states. [2019-09-10 06:57:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316552 to 244984. [2019-09-10 06:57:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244984 states. [2019-09-10 06:57:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244984 states to 244984 states and 354625 transitions. [2019-09-10 06:57:44,096 INFO L78 Accepts]: Start accepts. Automaton has 244984 states and 354625 transitions. Word has length 84 [2019-09-10 06:57:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:44,097 INFO L475 AbstractCegarLoop]: Abstraction has 244984 states and 354625 transitions. [2019-09-10 06:57:44,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:57:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 244984 states and 354625 transitions. [2019-09-10 06:57:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:57:44,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:44,106 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] [2019-09-10 06:57:44,107 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 77571385, now seen corresponding path program 1 times [2019-09-10 06:57:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:44,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:44,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 06:57:44,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:44,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:44,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:44,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:44,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:44,275 INFO L87 Difference]: Start difference. First operand 244984 states and 354625 transitions. Second operand 6 states. [2019-09-10 06:57:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:45,163 INFO L93 Difference]: Finished difference Result 233714 states and 333501 transitions. [2019-09-10 06:57:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:45,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 06:57:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:45,444 INFO L225 Difference]: With dead ends: 233714 [2019-09-10 06:57:45,444 INFO L226 Difference]: Without dead ends: 233714 [2019-09-10 06:57:45,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 06:57:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233714 states. [2019-09-10 06:57:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233714 to 217776. [2019-09-10 06:57:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217776 states. [2019-09-10 06:57:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217776 states to 217776 states and 311518 transitions. [2019-09-10 06:57:52,790 INFO L78 Accepts]: Start accepts. Automaton has 217776 states and 311518 transitions. Word has length 85 [2019-09-10 06:57:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:52,790 INFO L475 AbstractCegarLoop]: Abstraction has 217776 states and 311518 transitions. [2019-09-10 06:57:52,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 217776 states and 311518 transitions. [2019-09-10 06:57:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:57:52,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:52,801 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] [2019-09-10 06:57:52,801 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1594901541, now seen corresponding path program 1 times [2019-09-10 06:57:52,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:52,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:52,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:52,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:52,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:52,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:52,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:52,911 INFO L87 Difference]: Start difference. First operand 217776 states and 311518 transitions. Second operand 6 states. [2019-09-10 06:57:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:54,555 INFO L93 Difference]: Finished difference Result 379733 states and 534408 transitions. [2019-09-10 06:57:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:54,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 06:57:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:55,095 INFO L225 Difference]: With dead ends: 379733 [2019-09-10 06:57:55,096 INFO L226 Difference]: Without dead ends: 379733 [2019-09-10 06:57:55,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379733 states. [2019-09-10 06:58:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379733 to 223752. [2019-09-10 06:58:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223752 states. [2019-09-10 06:58:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223752 states to 223752 states and 316192 transitions. [2019-09-10 06:58:00,541 INFO L78 Accepts]: Start accepts. Automaton has 223752 states and 316192 transitions. Word has length 87 [2019-09-10 06:58:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:00,541 INFO L475 AbstractCegarLoop]: Abstraction has 223752 states and 316192 transitions. [2019-09-10 06:58:00,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 223752 states and 316192 transitions. [2019-09-10 06:58:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:58:00,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:00,554 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 06:58:00,555 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2113983979, now seen corresponding path program 1 times [2019-09-10 06:58:00,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:00,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:00,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:00,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:00,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:00,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:00,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:00,637 INFO L87 Difference]: Start difference. First operand 223752 states and 316192 transitions. Second operand 3 states. [2019-09-10 06:58:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:02,702 INFO L93 Difference]: Finished difference Result 402140 states and 561210 transitions. [2019-09-10 06:58:02,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:02,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 06:58:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:03,236 INFO L225 Difference]: With dead ends: 402140 [2019-09-10 06:58:03,237 INFO L226 Difference]: Without dead ends: 402140 [2019-09-10 06:58:03,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402140 states. [2019-09-10 06:58:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402140 to 397878. [2019-09-10 06:58:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397878 states. [2019-09-10 06:58:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397878 states to 397878 states and 556949 transitions. [2019-09-10 06:58:16,142 INFO L78 Accepts]: Start accepts. Automaton has 397878 states and 556949 transitions. Word has length 88 [2019-09-10 06:58:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:16,142 INFO L475 AbstractCegarLoop]: Abstraction has 397878 states and 556949 transitions. [2019-09-10 06:58:16,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 397878 states and 556949 transitions. [2019-09-10 06:58:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:58:16,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:16,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:16,158 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1328266356, now seen corresponding path program 1 times [2019-09-10 06:58:16,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:16,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:16,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:16,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:16,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:16,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:16,256 INFO L87 Difference]: Start difference. First operand 397878 states and 556949 transitions. Second operand 5 states. [2019-09-10 06:58:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:29,064 INFO L93 Difference]: Finished difference Result 1151038 states and 1589494 transitions. [2019-09-10 06:58:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:58:29,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 06:58:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:31,039 INFO L225 Difference]: With dead ends: 1151038 [2019-09-10 06:58:31,039 INFO L226 Difference]: Without dead ends: 1151038 [2019-09-10 06:58:31,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151038 states. [2019-09-10 06:58:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151038 to 707428. [2019-09-10 06:58:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707428 states. [2019-09-10 06:59:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707428 states to 707428 states and 982531 transitions. [2019-09-10 06:59:02,169 INFO L78 Accepts]: Start accepts. Automaton has 707428 states and 982531 transitions. Word has length 89 [2019-09-10 06:59:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:02,170 INFO L475 AbstractCegarLoop]: Abstraction has 707428 states and 982531 transitions. [2019-09-10 06:59:02,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 707428 states and 982531 transitions. [2019-09-10 06:59:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:59:02,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:02,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:02,183 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash 32135098, now seen corresponding path program 1 times [2019-09-10 06:59:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:02,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:02,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:02,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:02,269 INFO L87 Difference]: Start difference. First operand 707428 states and 982531 transitions. Second operand 5 states. [2019-09-10 06:59:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:14,639 INFO L93 Difference]: Finished difference Result 1538326 states and 2113878 transitions. [2019-09-10 06:59:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:59:14,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 06:59:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:27,425 INFO L225 Difference]: With dead ends: 1538326 [2019-09-10 06:59:27,426 INFO L226 Difference]: Without dead ends: 1538326 [2019-09-10 06:59:27,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538326 states. [2019-09-10 06:59:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538326 to 702939. [2019-09-10 06:59:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702939 states. [2019-09-10 06:59:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702939 states to 702939 states and 966621 transitions. [2019-09-10 06:59:54,894 INFO L78 Accepts]: Start accepts. Automaton has 702939 states and 966621 transitions. Word has length 89 [2019-09-10 06:59:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:54,894 INFO L475 AbstractCegarLoop]: Abstraction has 702939 states and 966621 transitions. [2019-09-10 06:59:54,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 702939 states and 966621 transitions. [2019-09-10 06:59:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:59:54,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:54,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:54,908 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 212814183, now seen corresponding path program 1 times [2019-09-10 06:59:54,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:54,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:54,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:54,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:54,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:54,993 INFO L87 Difference]: Start difference. First operand 702939 states and 966621 transitions. Second operand 5 states. [2019-09-10 07:00:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:03,552 INFO L93 Difference]: Finished difference Result 1553304 states and 2134116 transitions. [2019-09-10 07:00:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:03,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 07:00:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:19,503 INFO L225 Difference]: With dead ends: 1553304 [2019-09-10 07:00:19,503 INFO L226 Difference]: Without dead ends: 1553304 [2019-09-10 07:00:19,504 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:00:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553304 states. [2019-09-10 07:00:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553304 to 702919. [2019-09-10 07:00:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702919 states. [2019-09-10 07:00:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702919 states to 702919 states and 966589 transitions. [2019-09-10 07:00:37,366 INFO L78 Accepts]: Start accepts. Automaton has 702919 states and 966589 transitions. Word has length 89 [2019-09-10 07:00:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:37,367 INFO L475 AbstractCegarLoop]: Abstraction has 702919 states and 966589 transitions. [2019-09-10 07:00:37,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:00:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 702919 states and 966589 transitions. [2019-09-10 07:00:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:00:37,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:37,385 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:00:37,385 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash 292604995, now seen corresponding path program 1 times [2019-09-10 07:00:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:46,211 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:00:46,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:46,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:46,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:46,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:46,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:46,214 INFO L87 Difference]: Start difference. First operand 702919 states and 966589 transitions. Second operand 3 states. [2019-09-10 07:00:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:48,152 INFO L93 Difference]: Finished difference Result 702905 states and 957875 transitions. [2019-09-10 07:00:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:48,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:00:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:50,156 INFO L225 Difference]: With dead ends: 702905 [2019-09-10 07:00:50,156 INFO L226 Difference]: Without dead ends: 702905 [2019-09-10 07:00:50,156 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:00:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702905 states. [2019-09-10 07:01:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702905 to 629297. [2019-09-10 07:01:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629297 states. [2019-09-10 07:01:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629297 states to 629297 states and 858888 transitions. [2019-09-10 07:01:06,861 INFO L78 Accepts]: Start accepts. Automaton has 629297 states and 858888 transitions. Word has length 89 [2019-09-10 07:01:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:06,861 INFO L475 AbstractCegarLoop]: Abstraction has 629297 states and 858888 transitions. [2019-09-10 07:01:06,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 629297 states and 858888 transitions. [2019-09-10 07:01:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:01:06,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:06,884 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:01:06,884 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1264470514, now seen corresponding path program 1 times [2019-09-10 07:01:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:06,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:06,985 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:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:06,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:06,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:06,986 INFO L87 Difference]: Start difference. First operand 629297 states and 858888 transitions. Second operand 5 states. [2019-09-10 07:01:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:20,610 INFO L93 Difference]: Finished difference Result 1605985 states and 2173229 transitions. [2019-09-10 07:01:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:20,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 07:01:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:24,992 INFO L225 Difference]: With dead ends: 1605985 [2019-09-10 07:01:24,993 INFO L226 Difference]: Without dead ends: 1605985 [2019-09-10 07:01:24,993 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:01:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605985 states. [2019-09-10 07:01:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605985 to 1001704. [2019-09-10 07:01:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001704 states. [2019-09-10 07:02:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001704 states to 1001704 states and 1362538 transitions. [2019-09-10 07:02:09,862 INFO L78 Accepts]: Start accepts. Automaton has 1001704 states and 1362538 transitions. Word has length 91 [2019-09-10 07:02:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:09,863 INFO L475 AbstractCegarLoop]: Abstraction has 1001704 states and 1362538 transitions. [2019-09-10 07:02:09,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:02:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1001704 states and 1362538 transitions. [2019-09-10 07:02:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:02:09,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:09,878 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 70157973, now seen corresponding path program 1 times [2019-09-10 07:02:09,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:09,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:09,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:09,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:09,963 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:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:02:09,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:09,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:02:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:02:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:02:09,965 INFO L87 Difference]: Start difference. First operand 1001704 states and 1362538 transitions. Second operand 5 states. [2019-09-10 07:02:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:38,433 INFO L93 Difference]: Finished difference Result 2473402 states and 3312649 transitions. [2019-09-10 07:02:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:02:38,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 07:02:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:43,626 INFO L225 Difference]: With dead ends: 2473402 [2019-09-10 07:02:43,626 INFO L226 Difference]: Without dead ends: 2473402 [2019-09-10 07:02:43,626 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:02:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473402 states. [2019-09-10 07:03:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473402 to 1694888. [2019-09-10 07:03:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694888 states.