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.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:49:43,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:49:43,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:49:43,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:49:43,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:49:43,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:49:43,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:49:43,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:49:43,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:49:43,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:49:43,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:49:43,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:49:43,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:49:43,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:49:43,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:49:43,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:49:43,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:49:43,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:49:43,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:49:43,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:49:43,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:49:43,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:49:43,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:49:43,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:49:43,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:49:43,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:49:43,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:49:43,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:49:43,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:49:43,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:49:43,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:49:43,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:49:43,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:49:43,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:49:43,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:49:43,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:49:43,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:49:43,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:49:43,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:49:43,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:49:43,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:49:43,068 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:49:43,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:49:43,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:49:43,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:49:43,089 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:49:43,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:49:43,091 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:49:43,091 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:49:43,091 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:49:43,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:49:43,092 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:49:43,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:49:43,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:49:43,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:49:43,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:49:43,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:49:43,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:49:43,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:49:43,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:49:43,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:49:43,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:49:43,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:49:43,098 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:49:43,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:49:43,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:49:43,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:49:43,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:49:43,098 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:49:43,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:49:43,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:49:43,099 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:49:43,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:49:43,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:49:43,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:49:43,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:49:43,149 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:49:43,150 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.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:49:43,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309d95a7/ef724437854144619d2465d93cfd68ac/FLAG37de13661 [2019-09-10 06:49:44,022 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:49:44,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:49:44,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309d95a7/ef724437854144619d2465d93cfd68ac/FLAG37de13661 [2019-09-10 06:49:44,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309d95a7/ef724437854144619d2465d93cfd68ac [2019-09-10 06:49:44,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:49:44,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:49:44,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:49:44,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:49:44,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:49:44,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:49:44" (1/1) ... [2019-09-10 06:49:44,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af0ff91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:44, skipping insertion in model container [2019-09-10 06:49:44,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:49:44" (1/1) ... [2019-09-10 06:49:44,155 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:49:44,308 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:49:45,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:49:45,452 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:49:45,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:49:45,910 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:49:45,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45 WrapperNode [2019-09-10 06:49:45,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:49:45,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:49:45,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:49:45,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:49:45,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:46,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:49:46,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:49:46,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:49:46,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:49:46,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (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:49:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:49:46,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:49:46,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:49:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:49:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:49:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:49:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:49:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:49:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:49:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:49:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:49:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:49:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:49:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:49:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:49:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:49:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:49:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:49:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:49:49,772 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:49:49,773 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:49:49,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:49:49 BoogieIcfgContainer [2019-09-10 06:49:49,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:49:49,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:49:49,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:49:49,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:49:49,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:49:44" (1/3) ... [2019-09-10 06:49:49,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fa2bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:49:49, skipping insertion in model container [2019-09-10 06:49:49,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (2/3) ... [2019-09-10 06:49:49,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fa2bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:49:49, skipping insertion in model container [2019-09-10 06:49:49,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:49:49" (3/3) ... [2019-09-10 06:49:49,789 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:49:49,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:49:49,825 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 06:49:49,844 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 06:49:49,877 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:49:49,878 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:49:49,878 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:49:49,878 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:49:49,878 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:49:49,878 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:49:49,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:49:49,879 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:49:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states. [2019-09-10 06:49:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:49:49,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:49,975 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:49:49,979 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 971331392, now seen corresponding path program 1 times [2019-09-10 06:49:49,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:50,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:50,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:50,786 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:49:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:50,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:49:50,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:50,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:49:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:49:50,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:50,816 INFO L87 Difference]: Start difference. First operand 1111 states. Second operand 5 states. [2019-09-10 06:49:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:52,038 INFO L93 Difference]: Finished difference Result 1010 states and 1806 transitions. [2019-09-10 06:49:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:52,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:49:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:52,063 INFO L225 Difference]: With dead ends: 1010 [2019-09-10 06:49:52,063 INFO L226 Difference]: Without dead ends: 998 [2019-09-10 06:49:52,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-10 06:49:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 990. [2019-09-10 06:49:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-10 06:49:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1319 transitions. [2019-09-10 06:49:52,188 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1319 transitions. Word has length 68 [2019-09-10 06:49:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:52,189 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1319 transitions. [2019-09-10 06:49:52,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1319 transitions. [2019-09-10 06:49:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:49:52,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:52,194 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:49:52,194 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1328541618, now seen corresponding path program 1 times [2019-09-10 06:49:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:52,382 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:49:52,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:52,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:52,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:52,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:52,391 INFO L87 Difference]: Start difference. First operand 990 states and 1319 transitions. Second operand 3 states. [2019-09-10 06:49:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:52,440 INFO L93 Difference]: Finished difference Result 1565 states and 2101 transitions. [2019-09-10 06:49:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:52,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:49:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:52,450 INFO L225 Difference]: With dead ends: 1565 [2019-09-10 06:49:52,450 INFO L226 Difference]: Without dead ends: 1565 [2019-09-10 06:49:52,451 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:49:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-09-10 06:49:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1556. [2019-09-10 06:49:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-09-10 06:49:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2096 transitions. [2019-09-10 06:49:52,510 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2096 transitions. Word has length 69 [2019-09-10 06:49:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:52,515 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2096 transitions. [2019-09-10 06:49:52,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2096 transitions. [2019-09-10 06:49:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:49:52,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:52,525 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:49:52,525 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash 619214809, now seen corresponding path program 1 times [2019-09-10 06:49:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:52,745 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:49:52,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:52,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:52,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:52,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:52,747 INFO L87 Difference]: Start difference. First operand 1556 states and 2096 transitions. Second operand 3 states. [2019-09-10 06:49:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:52,815 INFO L93 Difference]: Finished difference Result 2047 states and 2803 transitions. [2019-09-10 06:49:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:52,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:49:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:52,827 INFO L225 Difference]: With dead ends: 2047 [2019-09-10 06:49:52,827 INFO L226 Difference]: Without dead ends: 2047 [2019-09-10 06:49:52,827 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:49:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-09-10 06:49:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2039. [2019-09-10 06:49:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-09-10 06:49:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2799 transitions. [2019-09-10 06:49:52,878 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2799 transitions. Word has length 69 [2019-09-10 06:49:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:52,878 INFO L475 AbstractCegarLoop]: Abstraction has 2039 states and 2799 transitions. [2019-09-10 06:49:52,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2799 transitions. [2019-09-10 06:49:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:49:52,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:52,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] [2019-09-10 06:49:52,885 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 211809038, now seen corresponding path program 1 times [2019-09-10 06:49:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:53,008 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:49:53,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:53,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:53,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:53,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:53,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:53,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:53,011 INFO L87 Difference]: Start difference. First operand 2039 states and 2799 transitions. Second operand 3 states. [2019-09-10 06:49:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:53,197 INFO L93 Difference]: Finished difference Result 2953 states and 4085 transitions. [2019-09-10 06:49:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:53,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:49:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:53,218 INFO L225 Difference]: With dead ends: 2953 [2019-09-10 06:49:53,218 INFO L226 Difference]: Without dead ends: 2953 [2019-09-10 06:49:53,219 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:49:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-09-10 06:49:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2945. [2019-09-10 06:49:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2019-09-10 06:49:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4081 transitions. [2019-09-10 06:49:53,335 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4081 transitions. Word has length 69 [2019-09-10 06:49:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:53,338 INFO L475 AbstractCegarLoop]: Abstraction has 2945 states and 4081 transitions. [2019-09-10 06:49:53,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4081 transitions. [2019-09-10 06:49:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:49:53,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:53,347 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:49:53,347 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2052603823, now seen corresponding path program 1 times [2019-09-10 06:49:53,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:53,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:53,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:53,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:53,592 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:49:53,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:53,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:53,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:53,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:53,595 INFO L87 Difference]: Start difference. First operand 2945 states and 4081 transitions. Second operand 6 states. [2019-09-10 06:49:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:54,367 INFO L93 Difference]: Finished difference Result 5571 states and 7881 transitions. [2019-09-10 06:49:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:54,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:49:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:54,394 INFO L225 Difference]: With dead ends: 5571 [2019-09-10 06:49:54,395 INFO L226 Difference]: Without dead ends: 5571 [2019-09-10 06:49:54,395 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:49:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-09-10 06:49:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5555. [2019-09-10 06:49:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5555 states. [2019-09-10 06:49:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 7873 transitions. [2019-09-10 06:49:54,588 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 7873 transitions. Word has length 69 [2019-09-10 06:49:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:54,588 INFO L475 AbstractCegarLoop]: Abstraction has 5555 states and 7873 transitions. [2019-09-10 06:49:54,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 7873 transitions. [2019-09-10 06:49:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:49:54,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:54,596 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:49:54,596 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash 449186189, now seen corresponding path program 1 times [2019-09-10 06:49:54,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:54,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:54,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:54,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:54,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:54,759 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:49:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:54,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:54,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:54,761 INFO L87 Difference]: Start difference. First operand 5555 states and 7873 transitions. Second operand 6 states. [2019-09-10 06:49:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:55,503 INFO L93 Difference]: Finished difference Result 10801 states and 15399 transitions. [2019-09-10 06:49:55,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:55,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:49:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:55,554 INFO L225 Difference]: With dead ends: 10801 [2019-09-10 06:49:55,554 INFO L226 Difference]: Without dead ends: 10801 [2019-09-10 06:49:55,555 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:49:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10801 states. [2019-09-10 06:49:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10801 to 10737. [2019-09-10 06:49:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10737 states. [2019-09-10 06:49:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 15343 transitions. [2019-09-10 06:49:55,759 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 15343 transitions. Word has length 70 [2019-09-10 06:49:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:55,760 INFO L475 AbstractCegarLoop]: Abstraction has 10737 states and 15343 transitions. [2019-09-10 06:49:55,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 15343 transitions. [2019-09-10 06:49:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:49:55,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:55,769 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:49:55,769 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 178317883, now seen corresponding path program 1 times [2019-09-10 06:49:55,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:55,879 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:49:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:55,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:55,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:55,882 INFO L87 Difference]: Start difference. First operand 10737 states and 15343 transitions. Second operand 3 states. [2019-09-10 06:49:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:55,976 INFO L93 Difference]: Finished difference Result 15819 states and 22371 transitions. [2019-09-10 06:49:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:55,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 06:49:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:56,024 INFO L225 Difference]: With dead ends: 15819 [2019-09-10 06:49:56,024 INFO L226 Difference]: Without dead ends: 15819 [2019-09-10 06:49:56,024 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:49:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15819 states. [2019-09-10 06:49:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15819 to 15731. [2019-09-10 06:49:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15731 states. [2019-09-10 06:49:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15731 states to 15731 states and 22287 transitions. [2019-09-10 06:49:56,477 INFO L78 Accepts]: Start accepts. Automaton has 15731 states and 22287 transitions. Word has length 70 [2019-09-10 06:49:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:56,477 INFO L475 AbstractCegarLoop]: Abstraction has 15731 states and 22287 transitions. [2019-09-10 06:49:56,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15731 states and 22287 transitions. [2019-09-10 06:49:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:49:56,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:56,492 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:49:56,493 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash 769375619, now seen corresponding path program 1 times [2019-09-10 06:49:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:56,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:56,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:56,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:56,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:56,692 INFO L87 Difference]: Start difference. First operand 15731 states and 22287 transitions. Second operand 6 states. [2019-09-10 06:49:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:57,477 INFO L93 Difference]: Finished difference Result 33315 states and 47033 transitions. [2019-09-10 06:49:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:57,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:49:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:57,544 INFO L225 Difference]: With dead ends: 33315 [2019-09-10 06:49:57,544 INFO L226 Difference]: Without dead ends: 33315 [2019-09-10 06:49:57,544 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:49:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33315 states. [2019-09-10 06:49:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33315 to 33099. [2019-09-10 06:49:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-09-10 06:49:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 46825 transitions. [2019-09-10 06:49:58,726 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 46825 transitions. Word has length 71 [2019-09-10 06:49:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:58,727 INFO L475 AbstractCegarLoop]: Abstraction has 33099 states and 46825 transitions. [2019-09-10 06:49:58,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 46825 transitions. [2019-09-10 06:49:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:49:58,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:58,738 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:49:58,739 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash -94739691, now seen corresponding path program 1 times [2019-09-10 06:49:58,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:58,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:49:58,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:58,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:49:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:49:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:58,892 INFO L87 Difference]: Start difference. First operand 33099 states and 46825 transitions. Second operand 7 states. [2019-09-10 06:50:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:01,173 INFO L93 Difference]: Finished difference Result 109136 states and 154102 transitions. [2019-09-10 06:50:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:01,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:50:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:01,463 INFO L225 Difference]: With dead ends: 109136 [2019-09-10 06:50:01,464 INFO L226 Difference]: Without dead ends: 109136 [2019-09-10 06:50:01,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109136 states. [2019-09-10 06:50:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109136 to 33127. [2019-09-10 06:50:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33127 states. [2019-09-10 06:50:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33127 states to 33127 states and 46861 transitions. [2019-09-10 06:50:02,613 INFO L78 Accepts]: Start accepts. Automaton has 33127 states and 46861 transitions. Word has length 72 [2019-09-10 06:50:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:02,613 INFO L475 AbstractCegarLoop]: Abstraction has 33127 states and 46861 transitions. [2019-09-10 06:50:02,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33127 states and 46861 transitions. [2019-09-10 06:50:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:50:02,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:02,625 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:50:02,625 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 446727203, now seen corresponding path program 1 times [2019-09-10 06:50:02,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:02,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:02,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:02,774 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:50:02,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:02,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:02,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:02,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:02,781 INFO L87 Difference]: Start difference. First operand 33127 states and 46861 transitions. Second operand 7 states. [2019-09-10 06:50:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:04,301 INFO L93 Difference]: Finished difference Result 124486 states and 176305 transitions. [2019-09-10 06:50:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:04,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:50:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:04,487 INFO L225 Difference]: With dead ends: 124486 [2019-09-10 06:50:04,488 INFO L226 Difference]: Without dead ends: 124486 [2019-09-10 06:50:04,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124486 states. [2019-09-10 06:50:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124486 to 33215. [2019-09-10 06:50:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33215 states. [2019-09-10 06:50:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33215 states to 33215 states and 46982 transitions. [2019-09-10 06:50:05,848 INFO L78 Accepts]: Start accepts. Automaton has 33215 states and 46982 transitions. Word has length 72 [2019-09-10 06:50:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:05,848 INFO L475 AbstractCegarLoop]: Abstraction has 33215 states and 46982 transitions. [2019-09-10 06:50:05,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 33215 states and 46982 transitions. [2019-09-10 06:50:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:50:05,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:05,860 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:50:05,860 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -228168160, now seen corresponding path program 1 times [2019-09-10 06:50:05,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:05,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:05,999 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:50:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:06,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:06,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:06,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:06,001 INFO L87 Difference]: Start difference. First operand 33215 states and 46982 transitions. Second operand 7 states. [2019-09-10 06:50:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:08,089 INFO L93 Difference]: Finished difference Result 180382 states and 257493 transitions. [2019-09-10 06:50:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:08,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:50:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:08,351 INFO L225 Difference]: With dead ends: 180382 [2019-09-10 06:50:08,351 INFO L226 Difference]: Without dead ends: 180382 [2019-09-10 06:50:08,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180382 states. [2019-09-10 06:50:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180382 to 33283. [2019-09-10 06:50:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33283 states. [2019-09-10 06:50:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33283 states to 33283 states and 47070 transitions. [2019-09-10 06:50:09,651 INFO L78 Accepts]: Start accepts. Automaton has 33283 states and 47070 transitions. Word has length 72 [2019-09-10 06:50:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:09,652 INFO L475 AbstractCegarLoop]: Abstraction has 33283 states and 47070 transitions. [2019-09-10 06:50:09,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33283 states and 47070 transitions. [2019-09-10 06:50:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:50:09,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:09,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:09,662 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1184969247, now seen corresponding path program 1 times [2019-09-10 06:50:09,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:09,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:09,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:09,780 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:50:09,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:09,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:09,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:09,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:09,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:09,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:09,782 INFO L87 Difference]: Start difference. First operand 33283 states and 47070 transitions. Second operand 7 states. [2019-09-10 06:50:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:12,079 INFO L93 Difference]: Finished difference Result 144450 states and 205391 transitions. [2019-09-10 06:50:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:12,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:50:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:12,289 INFO L225 Difference]: With dead ends: 144450 [2019-09-10 06:50:12,289 INFO L226 Difference]: Without dead ends: 144450 [2019-09-10 06:50:12,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144450 states. [2019-09-10 06:50:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144450 to 33446. [2019-09-10 06:50:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33446 states. [2019-09-10 06:50:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33446 states to 33446 states and 47285 transitions. [2019-09-10 06:50:13,422 INFO L78 Accepts]: Start accepts. Automaton has 33446 states and 47285 transitions. Word has length 72 [2019-09-10 06:50:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:13,423 INFO L475 AbstractCegarLoop]: Abstraction has 33446 states and 47285 transitions. [2019-09-10 06:50:13,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 33446 states and 47285 transitions. [2019-09-10 06:50:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:13,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:13,433 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:50:13,433 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 961373533, now seen corresponding path program 1 times [2019-09-10 06:50:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:13,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:13,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:13,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:13,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:13,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:13,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:13,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:13,691 INFO L87 Difference]: Start difference. First operand 33446 states and 47285 transitions. Second operand 9 states. [2019-09-10 06:50:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:16,049 INFO L93 Difference]: Finished difference Result 140994 states and 202736 transitions. [2019-09-10 06:50:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:50:16,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:50:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:16,215 INFO L225 Difference]: With dead ends: 140994 [2019-09-10 06:50:16,215 INFO L226 Difference]: Without dead ends: 140994 [2019-09-10 06:50:16,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:50:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140994 states. [2019-09-10 06:50:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140994 to 33418. [2019-09-10 06:50:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33418 states. [2019-09-10 06:50:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33418 states to 33418 states and 47241 transitions. [2019-09-10 06:50:17,444 INFO L78 Accepts]: Start accepts. Automaton has 33418 states and 47241 transitions. Word has length 73 [2019-09-10 06:50:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:17,444 INFO L475 AbstractCegarLoop]: Abstraction has 33418 states and 47241 transitions. [2019-09-10 06:50:17,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 33418 states and 47241 transitions. [2019-09-10 06:50:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:17,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:17,455 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:50:17,455 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 6553349, now seen corresponding path program 1 times [2019-09-10 06:50:17,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:17,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:17,581 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:50:17,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:17,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:17,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:17,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:17,583 INFO L87 Difference]: Start difference. First operand 33418 states and 47241 transitions. Second operand 7 states. [2019-09-10 06:50:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:19,203 INFO L93 Difference]: Finished difference Result 124751 states and 176650 transitions. [2019-09-10 06:50:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:19,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:50:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:19,393 INFO L225 Difference]: With dead ends: 124751 [2019-09-10 06:50:19,393 INFO L226 Difference]: Without dead ends: 124751 [2019-09-10 06:50:19,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124751 states. [2019-09-10 06:50:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124751 to 33509. [2019-09-10 06:50:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33509 states. [2019-09-10 06:50:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33509 states to 33509 states and 47369 transitions. [2019-09-10 06:50:20,394 INFO L78 Accepts]: Start accepts. Automaton has 33509 states and 47369 transitions. Word has length 73 [2019-09-10 06:50:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:20,395 INFO L475 AbstractCegarLoop]: Abstraction has 33509 states and 47369 transitions. [2019-09-10 06:50:20,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33509 states and 47369 transitions. [2019-09-10 06:50:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:20,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:20,402 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:50:20,402 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash -88849401, now seen corresponding path program 1 times [2019-09-10 06:50:20,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:20,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:20,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:20,586 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:50:20,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:20,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:20,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:20,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:20,588 INFO L87 Difference]: Start difference. First operand 33509 states and 47369 transitions. Second operand 9 states. [2019-09-10 06:50:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:22,673 INFO L93 Difference]: Finished difference Result 85384 states and 121921 transitions. [2019-09-10 06:50:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:50:22,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:50:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:22,776 INFO L225 Difference]: With dead ends: 85384 [2019-09-10 06:50:22,776 INFO L226 Difference]: Without dead ends: 85384 [2019-09-10 06:50:22,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:50:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85384 states. [2019-09-10 06:50:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85384 to 33497. [2019-09-10 06:50:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33497 states. [2019-09-10 06:50:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33497 states to 33497 states and 47345 transitions. [2019-09-10 06:50:23,606 INFO L78 Accepts]: Start accepts. Automaton has 33497 states and 47345 transitions. Word has length 73 [2019-09-10 06:50:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:23,607 INFO L475 AbstractCegarLoop]: Abstraction has 33497 states and 47345 transitions. [2019-09-10 06:50:23,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33497 states and 47345 transitions. [2019-09-10 06:50:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:23,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:23,615 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:50:23,615 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1080005182, now seen corresponding path program 1 times [2019-09-10 06:50:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:23,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:23,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:23,789 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:50:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:23,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:23,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:23,791 INFO L87 Difference]: Start difference. First operand 33497 states and 47345 transitions. Second operand 9 states. [2019-09-10 06:50:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:25,938 INFO L93 Difference]: Finished difference Result 134424 states and 191685 transitions. [2019-09-10 06:50:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:50:25,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:50:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:26,083 INFO L225 Difference]: With dead ends: 134424 [2019-09-10 06:50:26,083 INFO L226 Difference]: Without dead ends: 134424 [2019-09-10 06:50:26,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:50:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134424 states. [2019-09-10 06:50:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134424 to 33311. [2019-09-10 06:50:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33311 states. [2019-09-10 06:50:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33311 states to 33311 states and 47098 transitions. [2019-09-10 06:50:27,207 INFO L78 Accepts]: Start accepts. Automaton has 33311 states and 47098 transitions. Word has length 73 [2019-09-10 06:50:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:27,208 INFO L475 AbstractCegarLoop]: Abstraction has 33311 states and 47098 transitions. [2019-09-10 06:50:27,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33311 states and 47098 transitions. [2019-09-10 06:50:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:27,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:27,215 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:50:27,216 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash 8591348, now seen corresponding path program 1 times [2019-09-10 06:50:27,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:27,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:27,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:27,423 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:50:27,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:27,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:50:27,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:27,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:50:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:50:27,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:27,425 INFO L87 Difference]: Start difference. First operand 33311 states and 47098 transitions. Second operand 8 states. [2019-09-10 06:50:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:29,151 INFO L93 Difference]: Finished difference Result 110819 states and 158780 transitions. [2019-09-10 06:50:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:50:29,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-09-10 06:50:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:29,266 INFO L225 Difference]: With dead ends: 110819 [2019-09-10 06:50:29,266 INFO L226 Difference]: Without dead ends: 110819 [2019-09-10 06:50:29,267 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:50:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110819 states. [2019-09-10 06:50:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110819 to 32719. [2019-09-10 06:50:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32719 states. [2019-09-10 06:50:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32719 states to 32719 states and 46326 transitions. [2019-09-10 06:50:29,847 INFO L78 Accepts]: Start accepts. Automaton has 32719 states and 46326 transitions. Word has length 73 [2019-09-10 06:50:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:29,847 INFO L475 AbstractCegarLoop]: Abstraction has 32719 states and 46326 transitions. [2019-09-10 06:50:29,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:50:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32719 states and 46326 transitions. [2019-09-10 06:50:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:29,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:29,853 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:50:29,853 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 591574109, now seen corresponding path program 1 times [2019-09-10 06:50:29,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:29,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:29,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:30,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:50:30,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:30,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:50:30,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:30,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:50:30,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:50:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:50:30,297 INFO L87 Difference]: Start difference. First operand 32719 states and 46326 transitions. Second operand 11 states. [2019-09-10 06:50:30,588 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-09-10 06:50:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:32,743 INFO L93 Difference]: Finished difference Result 170924 states and 244802 transitions. [2019-09-10 06:50:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:50:32,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-09-10 06:50:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:32,941 INFO L225 Difference]: With dead ends: 170924 [2019-09-10 06:50:32,941 INFO L226 Difference]: Without dead ends: 170924 [2019-09-10 06:50:32,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:50:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170924 states. [2019-09-10 06:50:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170924 to 32252. [2019-09-10 06:50:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32252 states. [2019-09-10 06:50:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32252 states to 32252 states and 45688 transitions. [2019-09-10 06:50:33,773 INFO L78 Accepts]: Start accepts. Automaton has 32252 states and 45688 transitions. Word has length 74 [2019-09-10 06:50:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:33,774 INFO L475 AbstractCegarLoop]: Abstraction has 32252 states and 45688 transitions. [2019-09-10 06:50:33,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:50:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32252 states and 45688 transitions. [2019-09-10 06:50:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:33,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:33,778 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:50:33,779 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 199562019, now seen corresponding path program 1 times [2019-09-10 06:50:33,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:33,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:33,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:34,255 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:50:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:34,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:50:34,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:34,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:50:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:50:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:50:34,256 INFO L87 Difference]: Start difference. First operand 32252 states and 45688 transitions. Second operand 12 states. [2019-09-10 06:50:35,219 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 06:50:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:37,076 INFO L93 Difference]: Finished difference Result 187702 states and 269617 transitions. [2019-09-10 06:50:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:50:37,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:50:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:37,279 INFO L225 Difference]: With dead ends: 187702 [2019-09-10 06:50:37,280 INFO L226 Difference]: Without dead ends: 187702 [2019-09-10 06:50:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:50:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187702 states. [2019-09-10 06:50:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187702 to 32175. [2019-09-10 06:50:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32175 states. [2019-09-10 06:50:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32175 states to 32175 states and 45577 transitions. [2019-09-10 06:50:38,198 INFO L78 Accepts]: Start accepts. Automaton has 32175 states and 45577 transitions. Word has length 74 [2019-09-10 06:50:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:38,198 INFO L475 AbstractCegarLoop]: Abstraction has 32175 states and 45577 transitions. [2019-09-10 06:50:38,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:50:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32175 states and 45577 transitions. [2019-09-10 06:50:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:38,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:38,203 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:50:38,204 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 662330837, now seen corresponding path program 1 times [2019-09-10 06:50:38,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:38,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:38,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:38,609 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:50:38,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:50:38,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:38,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:50:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:50:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:50:38,611 INFO L87 Difference]: Start difference. First operand 32175 states and 45577 transitions. Second operand 12 states. [2019-09-10 06:50:40,693 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 06:50:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:41,464 INFO L93 Difference]: Finished difference Result 188304 states and 270274 transitions. [2019-09-10 06:50:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:50:41,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:50:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:41,677 INFO L225 Difference]: With dead ends: 188304 [2019-09-10 06:50:41,677 INFO L226 Difference]: Without dead ends: 188304 [2019-09-10 06:50:41,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:50:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188304 states. [2019-09-10 06:50:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188304 to 31779. [2019-09-10 06:50:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31779 states. [2019-09-10 06:50:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31779 states to 31779 states and 45078 transitions. [2019-09-10 06:50:42,570 INFO L78 Accepts]: Start accepts. Automaton has 31779 states and 45078 transitions. Word has length 74 [2019-09-10 06:50:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:42,571 INFO L475 AbstractCegarLoop]: Abstraction has 31779 states and 45078 transitions. [2019-09-10 06:50:42,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:50:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31779 states and 45078 transitions. [2019-09-10 06:50:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:50:42,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:42,577 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:50:42,577 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1361298504, now seen corresponding path program 1 times [2019-09-10 06:50:42,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:42,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:42,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:42,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:42,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:42,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:42,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:42,659 INFO L87 Difference]: Start difference. First operand 31779 states and 45078 transitions. Second operand 3 states. [2019-09-10 06:50:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:42,755 INFO L93 Difference]: Finished difference Result 31783 states and 44564 transitions. [2019-09-10 06:50:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:42,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:50:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:42,794 INFO L225 Difference]: With dead ends: 31783 [2019-09-10 06:50:42,795 INFO L226 Difference]: Without dead ends: 31783 [2019-09-10 06:50:42,795 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:50:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31783 states. [2019-09-10 06:50:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31783 to 31779. [2019-09-10 06:50:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31779 states. [2019-09-10 06:50:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31779 states to 31779 states and 44562 transitions. [2019-09-10 06:50:43,154 INFO L78 Accepts]: Start accepts. Automaton has 31779 states and 44562 transitions. Word has length 75 [2019-09-10 06:50:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:43,154 INFO L475 AbstractCegarLoop]: Abstraction has 31779 states and 44562 transitions. [2019-09-10 06:50:43,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31779 states and 44562 transitions. [2019-09-10 06:50:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:50:43,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:43,160 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:50:43,160 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash 42269280, now seen corresponding path program 1 times [2019-09-10 06:50:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:43,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:43,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:43,241 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:50:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:43,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:43,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:43,244 INFO L87 Difference]: Start difference. First operand 31779 states and 44562 transitions. Second operand 3 states. [2019-09-10 06:50:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:43,492 INFO L93 Difference]: Finished difference Result 47455 states and 66939 transitions. [2019-09-10 06:50:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:43,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:50:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:43,539 INFO L225 Difference]: With dead ends: 47455 [2019-09-10 06:50:43,540 INFO L226 Difference]: Without dead ends: 47455 [2019-09-10 06:50:43,540 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:50:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47455 states. [2019-09-10 06:50:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47455 to 37083. [2019-09-10 06:50:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37083 states. [2019-09-10 06:50:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37083 states to 37083 states and 52268 transitions. [2019-09-10 06:50:44,031 INFO L78 Accepts]: Start accepts. Automaton has 37083 states and 52268 transitions. Word has length 76 [2019-09-10 06:50:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:44,032 INFO L475 AbstractCegarLoop]: Abstraction has 37083 states and 52268 transitions. [2019-09-10 06:50:44,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37083 states and 52268 transitions. [2019-09-10 06:50:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:50:44,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:44,037 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:50:44,038 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2110038432, now seen corresponding path program 1 times [2019-09-10 06:50:44,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:44,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:44,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:44,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:44,117 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:50:44,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:44,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:44,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:44,119 INFO L87 Difference]: Start difference. First operand 37083 states and 52268 transitions. Second operand 3 states. [2019-09-10 06:50:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:44,259 INFO L93 Difference]: Finished difference Result 40230 states and 56660 transitions. [2019-09-10 06:50:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:44,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:50:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:44,300 INFO L225 Difference]: With dead ends: 40230 [2019-09-10 06:50:44,300 INFO L226 Difference]: Without dead ends: 40230 [2019-09-10 06:50:44,300 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:50:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40230 states. [2019-09-10 06:50:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40230 to 35853. [2019-09-10 06:50:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35853 states. [2019-09-10 06:50:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35853 states to 35853 states and 50609 transitions. [2019-09-10 06:50:44,605 INFO L78 Accepts]: Start accepts. Automaton has 35853 states and 50609 transitions. Word has length 76 [2019-09-10 06:50:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 35853 states and 50609 transitions. [2019-09-10 06:50:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35853 states and 50609 transitions. [2019-09-10 06:50:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:50:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:44,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:44,610 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1012060291, now seen corresponding path program 1 times [2019-09-10 06:50:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:44,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:44,787 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:50:44,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:44,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:44,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:44,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:44,789 INFO L87 Difference]: Start difference. First operand 35853 states and 50609 transitions. Second operand 9 states. [2019-09-10 06:50:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:46,829 INFO L93 Difference]: Finished difference Result 124476 states and 177209 transitions. [2019-09-10 06:50:46,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:50:46,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 06:50:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:46,970 INFO L225 Difference]: With dead ends: 124476 [2019-09-10 06:50:46,971 INFO L226 Difference]: Without dead ends: 124476 [2019-09-10 06:50:46,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:50:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124476 states. [2019-09-10 06:50:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124476 to 35781. [2019-09-10 06:50:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35781 states. [2019-09-10 06:50:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35781 states to 35781 states and 50511 transitions. [2019-09-10 06:50:48,136 INFO L78 Accepts]: Start accepts. Automaton has 35781 states and 50511 transitions. Word has length 77 [2019-09-10 06:50:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:48,136 INFO L475 AbstractCegarLoop]: Abstraction has 35781 states and 50511 transitions. [2019-09-10 06:50:48,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35781 states and 50511 transitions. [2019-09-10 06:50:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:50:48,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:48,140 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:50:48,141 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash 386283916, now seen corresponding path program 1 times [2019-09-10 06:50:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:48,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:48,222 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:50:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:48,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:48,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:48,224 INFO L87 Difference]: Start difference. First operand 35781 states and 50511 transitions. Second operand 3 states. [2019-09-10 06:50:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:48,349 INFO L93 Difference]: Finished difference Result 35785 states and 49990 transitions. [2019-09-10 06:50:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:48,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:50:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:48,396 INFO L225 Difference]: With dead ends: 35785 [2019-09-10 06:50:48,397 INFO L226 Difference]: Without dead ends: 35785 [2019-09-10 06:50:48,397 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:50:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35785 states. [2019-09-10 06:50:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35785 to 35781. [2019-09-10 06:50:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35781 states. [2019-09-10 06:50:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35781 states to 35781 states and 49988 transitions. [2019-09-10 06:50:48,820 INFO L78 Accepts]: Start accepts. Automaton has 35781 states and 49988 transitions. Word has length 78 [2019-09-10 06:50:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:48,821 INFO L475 AbstractCegarLoop]: Abstraction has 35781 states and 49988 transitions. [2019-09-10 06:50:48,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 35781 states and 49988 transitions. [2019-09-10 06:50:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:50:48,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:48,829 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] [2019-09-10 06:50:48,829 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1282642039, now seen corresponding path program 1 times [2019-09-10 06:50:48,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:48,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:48,911 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:50:48,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:48,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:48,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:48,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:48,913 INFO L87 Difference]: Start difference. First operand 35781 states and 49988 transitions. Second operand 3 states. [2019-09-10 06:50:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:49,145 INFO L93 Difference]: Finished difference Result 54806 states and 76780 transitions. [2019-09-10 06:50:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:49,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 06:50:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:49,224 INFO L225 Difference]: With dead ends: 54806 [2019-09-10 06:50:49,224 INFO L226 Difference]: Without dead ends: 54806 [2019-09-10 06:50:49,224 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:50:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54806 states. [2019-09-10 06:50:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54806 to 35644. [2019-09-10 06:50:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35644 states. [2019-09-10 06:50:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35644 states to 35644 states and 49700 transitions. [2019-09-10 06:50:49,637 INFO L78 Accepts]: Start accepts. Automaton has 35644 states and 49700 transitions. Word has length 80 [2019-09-10 06:50:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:49,638 INFO L475 AbstractCegarLoop]: Abstraction has 35644 states and 49700 transitions. [2019-09-10 06:50:49,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35644 states and 49700 transitions. [2019-09-10 06:50:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:50:49,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:49,645 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] [2019-09-10 06:50:49,645 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1433154749, now seen corresponding path program 1 times [2019-09-10 06:50:49,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:49,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:50,421 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:50:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:50,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:50:50,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:50,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:50:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:50:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:50:50,422 INFO L87 Difference]: Start difference. First operand 35644 states and 49700 transitions. Second operand 17 states. [2019-09-10 06:50:51,059 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:50:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:52,875 INFO L93 Difference]: Finished difference Result 57661 states and 80673 transitions. [2019-09-10 06:50:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:50:52,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-09-10 06:50:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:52,934 INFO L225 Difference]: With dead ends: 57661 [2019-09-10 06:50:52,934 INFO L226 Difference]: Without dead ends: 57661 [2019-09-10 06:50:52,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:50:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57661 states. [2019-09-10 06:50:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57661 to 35580. [2019-09-10 06:50:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35580 states. [2019-09-10 06:50:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35580 states to 35580 states and 49620 transitions. [2019-09-10 06:50:53,622 INFO L78 Accepts]: Start accepts. Automaton has 35580 states and 49620 transitions. Word has length 80 [2019-09-10 06:50:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:53,622 INFO L475 AbstractCegarLoop]: Abstraction has 35580 states and 49620 transitions. [2019-09-10 06:50:53,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:50:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35580 states and 49620 transitions. [2019-09-10 06:50:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:50:53,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:53,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:53,630 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 81860216, now seen corresponding path program 1 times [2019-09-10 06:50:53,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:53,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:54,335 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:50:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:50:54,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:54,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:50:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:50:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:50:54,337 INFO L87 Difference]: Start difference. First operand 35580 states and 49620 transitions. Second operand 16 states. [2019-09-10 06:50:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:57,202 INFO L93 Difference]: Finished difference Result 123600 states and 174371 transitions. [2019-09-10 06:50:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:50:57,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-10 06:50:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:57,355 INFO L225 Difference]: With dead ends: 123600 [2019-09-10 06:50:57,355 INFO L226 Difference]: Without dead ends: 123600 [2019-09-10 06:50:57,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:50:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123600 states. [2019-09-10 06:50:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123600 to 35574. [2019-09-10 06:50:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35574 states. [2019-09-10 06:50:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35574 states to 35574 states and 49611 transitions. [2019-09-10 06:50:58,010 INFO L78 Accepts]: Start accepts. Automaton has 35574 states and 49611 transitions. Word has length 81 [2019-09-10 06:50:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:58,010 INFO L475 AbstractCegarLoop]: Abstraction has 35574 states and 49611 transitions. [2019-09-10 06:50:58,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:50:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35574 states and 49611 transitions. [2019-09-10 06:50:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:50:58,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:58,028 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] [2019-09-10 06:50:58,028 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2040450539, now seen corresponding path program 1 times [2019-09-10 06:50:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:58,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:58,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:58,141 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:50:58,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:58,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:58,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:58,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:58,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:58,143 INFO L87 Difference]: Start difference. First operand 35574 states and 49611 transitions. Second operand 7 states. [2019-09-10 06:50:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:58,848 INFO L93 Difference]: Finished difference Result 257280 states and 356547 transitions. [2019-09-10 06:50:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:50:58,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 06:50:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:59,159 INFO L225 Difference]: With dead ends: 257280 [2019-09-10 06:50:59,159 INFO L226 Difference]: Without dead ends: 257280 [2019-09-10 06:50:59,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257280 states. [2019-09-10 06:51:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257280 to 134304. [2019-09-10 06:51:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134304 states. [2019-09-10 06:51:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134304 states to 134304 states and 186341 transitions. [2019-09-10 06:51:01,164 INFO L78 Accepts]: Start accepts. Automaton has 134304 states and 186341 transitions. Word has length 90 [2019-09-10 06:51:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:01,164 INFO L475 AbstractCegarLoop]: Abstraction has 134304 states and 186341 transitions. [2019-09-10 06:51:01,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:51:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 134304 states and 186341 transitions. [2019-09-10 06:51:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:51:01,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:01,195 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 06:51:01,195 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:01,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1916809887, now seen corresponding path program 1 times [2019-09-10 06:51:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:01,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:01,326 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:51:01,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:01,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:51:01,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:01,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:51:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:51:01,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:51:01,328 INFO L87 Difference]: Start difference. First operand 134304 states and 186341 transitions. Second operand 6 states. [2019-09-10 06:51:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:01,832 INFO L93 Difference]: Finished difference Result 156332 states and 212518 transitions. [2019-09-10 06:51:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:51:01,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 06:51:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:02,141 INFO L225 Difference]: With dead ends: 156332 [2019-09-10 06:51:02,142 INFO L226 Difference]: Without dead ends: 155896 [2019-09-10 06:51:02,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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:51:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155896 states. [2019-09-10 06:51:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155896 to 117531. [2019-09-10 06:51:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117531 states. [2019-09-10 06:51:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117531 states to 117531 states and 160066 transitions. [2019-09-10 06:51:05,867 INFO L78 Accepts]: Start accepts. Automaton has 117531 states and 160066 transitions. Word has length 91 [2019-09-10 06:51:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:05,867 INFO L475 AbstractCegarLoop]: Abstraction has 117531 states and 160066 transitions. [2019-09-10 06:51:05,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:51:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 117531 states and 160066 transitions. [2019-09-10 06:51:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:51:05,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:05,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:05,892 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1828567747, now seen corresponding path program 1 times [2019-09-10 06:51:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:05,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:06,003 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:51:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:06,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:51:06,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:06,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:51:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:51:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:51:06,004 INFO L87 Difference]: Start difference. First operand 117531 states and 160066 transitions. Second operand 6 states. [2019-09-10 06:51:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:06,676 INFO L93 Difference]: Finished difference Result 220684 states and 296833 transitions. [2019-09-10 06:51:06,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:51:06,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-10 06:51:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:07,001 INFO L225 Difference]: With dead ends: 220684 [2019-09-10 06:51:07,001 INFO L226 Difference]: Without dead ends: 220684 [2019-09-10 06:51:07,001 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:51:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220684 states. [2019-09-10 06:51:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220684 to 119901. [2019-09-10 06:51:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119901 states. [2019-09-10 06:51:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119901 states to 119901 states and 161646 transitions. [2019-09-10 06:51:11,868 INFO L78 Accepts]: Start accepts. Automaton has 119901 states and 161646 transitions. Word has length 92 [2019-09-10 06:51:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:11,868 INFO L475 AbstractCegarLoop]: Abstraction has 119901 states and 161646 transitions. [2019-09-10 06:51:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:51:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 119901 states and 161646 transitions. [2019-09-10 06:51:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:51:11,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:11,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:11,899 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -375474182, now seen corresponding path program 1 times [2019-09-10 06:51:11,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:11,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:11,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:11,988 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:51:11,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:11,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:11,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:11,990 INFO L87 Difference]: Start difference. First operand 119901 states and 161646 transitions. Second operand 3 states. [2019-09-10 06:51:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:12,616 INFO L93 Difference]: Finished difference Result 228941 states and 305378 transitions. [2019-09-10 06:51:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:12,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:51:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:12,926 INFO L225 Difference]: With dead ends: 228941 [2019-09-10 06:51:12,926 INFO L226 Difference]: Without dead ends: 228941 [2019-09-10 06:51:12,927 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:51:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228941 states. [2019-09-10 06:51:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228941 to 216923. [2019-09-10 06:51:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216923 states. [2019-09-10 06:51:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216923 states to 216923 states and 290106 transitions. [2019-09-10 06:51:16,067 INFO L78 Accepts]: Start accepts. Automaton has 216923 states and 290106 transitions. Word has length 93 [2019-09-10 06:51:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:16,068 INFO L475 AbstractCegarLoop]: Abstraction has 216923 states and 290106 transitions. [2019-09-10 06:51:16,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 216923 states and 290106 transitions. [2019-09-10 06:51:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:51:16,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:16,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:16,090 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1097923101, now seen corresponding path program 1 times [2019-09-10 06:51:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:16,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:16,170 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:51:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:16,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:16,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:16,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:16,176 INFO L87 Difference]: Start difference. First operand 216923 states and 290106 transitions. Second operand 3 states. [2019-09-10 06:51:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:16,997 INFO L93 Difference]: Finished difference Result 327429 states and 433513 transitions. [2019-09-10 06:51:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:16,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:51:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:17,440 INFO L225 Difference]: With dead ends: 327429 [2019-09-10 06:51:17,441 INFO L226 Difference]: Without dead ends: 327429 [2019-09-10 06:51:17,441 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:51:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327429 states. [2019-09-10 06:51:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327429 to 327427. [2019-09-10 06:51:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327427 states. [2019-09-10 06:51:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327427 states to 327427 states and 433512 transitions. [2019-09-10 06:51:24,999 INFO L78 Accepts]: Start accepts. Automaton has 327427 states and 433512 transitions. Word has length 94 [2019-09-10 06:51:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:24,999 INFO L475 AbstractCegarLoop]: Abstraction has 327427 states and 433512 transitions. [2019-09-10 06:51:24,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 327427 states and 433512 transitions. [2019-09-10 06:51:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:51:25,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:25,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:25,024 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1116383368, now seen corresponding path program 1 times [2019-09-10 06:51:25,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:25,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:25,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:25,110 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:51:25,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:25,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:51:25,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:25,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:51:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:51:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:51:25,111 INFO L87 Difference]: Start difference. First operand 327427 states and 433512 transitions. Second operand 5 states. [2019-09-10 06:51:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:28,037 INFO L93 Difference]: Finished difference Result 672164 states and 874417 transitions. [2019-09-10 06:51:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:51:28,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:51:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:29,002 INFO L225 Difference]: With dead ends: 672164 [2019-09-10 06:51:29,002 INFO L226 Difference]: Without dead ends: 672164 [2019-09-10 06:51:29,003 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:51:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672164 states. [2019-09-10 06:51:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672164 to 357925. [2019-09-10 06:51:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357925 states. [2019-09-10 06:51:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357925 states to 357925 states and 466787 transitions. [2019-09-10 06:51:41,591 INFO L78 Accepts]: Start accepts. Automaton has 357925 states and 466787 transitions. Word has length 95 [2019-09-10 06:51:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:41,591 INFO L475 AbstractCegarLoop]: Abstraction has 357925 states and 466787 transitions. [2019-09-10 06:51:41,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:51:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 357925 states and 466787 transitions. [2019-09-10 06:51:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:51:41,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:41,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:41,607 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash -930962315, now seen corresponding path program 1 times [2019-09-10 06:51:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:41,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:41,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:41,690 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:51:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:41,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:51:41,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:41,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:51:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:51:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:51:41,692 INFO L87 Difference]: Start difference. First operand 357925 states and 466787 transitions. Second operand 5 states. [2019-09-10 06:51:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:52,534 INFO L93 Difference]: Finished difference Result 1154833 states and 1489711 transitions. [2019-09-10 06:51:52,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:51:52,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:51:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:54,300 INFO L225 Difference]: With dead ends: 1154833 [2019-09-10 06:51:54,300 INFO L226 Difference]: Without dead ends: 1154833 [2019-09-10 06:51:54,301 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:51:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154833 states. [2019-09-10 06:52:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154833 to 675854. [2019-09-10 06:52:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675854 states. [2019-09-10 06:52:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675854 states to 675854 states and 878834 transitions. [2019-09-10 06:52:14,795 INFO L78 Accepts]: Start accepts. Automaton has 675854 states and 878834 transitions. Word has length 95 [2019-09-10 06:52:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:14,795 INFO L475 AbstractCegarLoop]: Abstraction has 675854 states and 878834 transitions. [2019-09-10 06:52:14,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:52:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 675854 states and 878834 transitions. [2019-09-10 06:52:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:52:14,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:14,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:14,832 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 9941761, now seen corresponding path program 1 times [2019-09-10 06:52:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:14,924 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:52:14,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:14,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:52:14,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:14,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:52:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:52:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:52:14,926 INFO L87 Difference]: Start difference. First operand 675854 states and 878834 transitions. Second operand 5 states. [2019-09-10 06:52:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:33,155 INFO L93 Difference]: Finished difference Result 2013092 states and 2573182 transitions. [2019-09-10 06:52:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:52:33,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 06:52:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:37,835 INFO L225 Difference]: With dead ends: 2013092 [2019-09-10 06:52:37,835 INFO L226 Difference]: Without dead ends: 2013092 [2019-09-10 06:52:37,836 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:52:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013092 states. [2019-09-10 06:53:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013092 to 1199142. [2019-09-10 06:53:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199142 states. [2019-09-10 06:53:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199142 states to 1199142 states and 1559332 transitions. [2019-09-10 06:53:21,844 INFO L78 Accepts]: Start accepts. Automaton has 1199142 states and 1559332 transitions. Word has length 106 [2019-09-10 06:53:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:21,845 INFO L475 AbstractCegarLoop]: Abstraction has 1199142 states and 1559332 transitions. [2019-09-10 06:53:21,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:53:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1199142 states and 1559332 transitions. [2019-09-10 06:53:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:53:22,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:22,009 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:22,009 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1774851115, now seen corresponding path program 1 times [2019-09-10 06:53:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:22,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:22,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:22,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:22,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:22,116 INFO L87 Difference]: Start difference. First operand 1199142 states and 1559332 transitions. Second operand 3 states. [2019-09-10 06:53:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:39,643 INFO L93 Difference]: Finished difference Result 2285995 states and 2925990 transitions. [2019-09-10 06:53:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:39,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:53:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:56,070 INFO L225 Difference]: With dead ends: 2285995 [2019-09-10 06:53:56,070 INFO L226 Difference]: Without dead ends: 2261469 [2019-09-10 06:53:56,071 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:53:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261469 states. [2019-09-10 06:54:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261469 to 1657390. [2019-09-10 06:54:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657390 states.