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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:37,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:37,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:37,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:37,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:37,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:37,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:37,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:37,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:37,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:37,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:37,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:37,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:37,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:37,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:37,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:37,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:37,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:37,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:37,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:37,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:37,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:37,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:37,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:37,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:37,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:37,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:37,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:37,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:37,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:37,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:37,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:37,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:37,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:37,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:37,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:37,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:37,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:37,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:37,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:37,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:37,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:21:37,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:37,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:37,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:37,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:37,625 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:37,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:37,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:37,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:37,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:37,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:37,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:37,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:37,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:37,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:37,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:37,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:37,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:37,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:37,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:37,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:37,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:37,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:37,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:37,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:37,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:37,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:37,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:37,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:37,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:21:37,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:37,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:37,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:37,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:37,917 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:37,917 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:37,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed6247d4/ec178f58f33d4b1cbcd66522c407ab17/FLAG59d86f30d [2019-10-13 23:21:38,683 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:38,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:38,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed6247d4/ec178f58f33d4b1cbcd66522c407ab17/FLAG59d86f30d [2019-10-13 23:21:38,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed6247d4/ec178f58f33d4b1cbcd66522c407ab17 [2019-10-13 23:21:38,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:38,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:38,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:38,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:38,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:38,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:38" (1/1) ... [2019-10-13 23:21:38,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:38, skipping insertion in model container [2019-10-13 23:21:38,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:38" (1/1) ... [2019-10-13 23:21:38,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:39,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:39,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:40,006 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:40,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:40,329 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:40,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40 WrapperNode [2019-10-13 23:21:40,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:40,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:40,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:40,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:40,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:40,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:40,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:40,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:40,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (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-10-13 23:21:40,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:40,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:40,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:40,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:40,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:21:40,647 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:40,649 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:40,649 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:40,649 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:40,650 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:40,650 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:44,623 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:44,623 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:44,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:44 BoogieIcfgContainer [2019-10-13 23:21:44,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:44,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:44,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:44,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:44,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:38" (1/3) ... [2019-10-13 23:21:44,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:44, skipping insertion in model container [2019-10-13 23:21:44,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (2/3) ... [2019-10-13 23:21:44,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:44, skipping insertion in model container [2019-10-13 23:21:44,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:44" (3/3) ... [2019-10-13 23:21:44,642 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:44,652 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:44,663 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 23:21:44,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 23:21:44,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:44,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:44,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:44,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:44,715 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:44,715 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:44,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:44,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-10-13 23:21:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:44,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:44,792 INFO L380 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] [2019-10-13 23:21:44,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-10-13 23:21:44,809 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:44,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947496664] [2019-10-13 23:21:44,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:45,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947496664] [2019-10-13 23:21:45,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:45,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:45,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934308378] [2019-10-13 23:21:45,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:45,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:45,403 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-10-13 23:21:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:47,395 INFO L93 Difference]: Finished difference Result 2278 states and 3982 transitions. [2019-10-13 23:21:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:47,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:21:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:47,439 INFO L225 Difference]: With dead ends: 2278 [2019-10-13 23:21:47,439 INFO L226 Difference]: Without dead ends: 1426 [2019-10-13 23:21:47,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-10-13 23:21:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1420. [2019-10-13 23:21:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-10-13 23:21:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1862 transitions. [2019-10-13 23:21:47,745 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1862 transitions. Word has length 54 [2019-10-13 23:21:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:47,746 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 1862 transitions. [2019-10-13 23:21:47,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1862 transitions. [2019-10-13 23:21:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:47,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:47,755 INFO L380 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] [2019-10-13 23:21:47,755 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-10-13 23:21:47,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:47,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113885583] [2019-10-13 23:21:47,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:48,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113885583] [2019-10-13 23:21:48,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:48,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:48,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737976272] [2019-10-13 23:21:48,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:48,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:48,073 INFO L87 Difference]: Start difference. First operand 1420 states and 1862 transitions. Second operand 6 states. [2019-10-13 23:21:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:49,272 INFO L93 Difference]: Finished difference Result 2953 states and 3915 transitions. [2019-10-13 23:21:49,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:49,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:21:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:49,283 INFO L225 Difference]: With dead ends: 2953 [2019-10-13 23:21:49,283 INFO L226 Difference]: Without dead ends: 1982 [2019-10-13 23:21:49,286 INFO L600 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-10-13 23:21:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-10-13 23:21:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1966. [2019-10-13 23:21:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-10-13 23:21:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2586 transitions. [2019-10-13 23:21:49,359 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2586 transitions. Word has length 55 [2019-10-13 23:21:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:49,360 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 2586 transitions. [2019-10-13 23:21:49,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2586 transitions. [2019-10-13 23:21:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:49,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:49,364 INFO L380 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] [2019-10-13 23:21:49,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-10-13 23:21:49,365 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:49,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160904257] [2019-10-13 23:21:49,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:49,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160904257] [2019-10-13 23:21:49,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:49,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:49,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51255334] [2019-10-13 23:21:49,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:49,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:49,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:49,487 INFO L87 Difference]: Start difference. First operand 1966 states and 2586 transitions. Second operand 6 states. [2019-10-13 23:21:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:50,870 INFO L93 Difference]: Finished difference Result 4903 states and 6449 transitions. [2019-10-13 23:21:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:21:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:50,896 INFO L225 Difference]: With dead ends: 4903 [2019-10-13 23:21:50,896 INFO L226 Difference]: Without dead ends: 3594 [2019-10-13 23:21:50,901 INFO L600 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-10-13 23:21:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-13 23:21:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3574. [2019-10-13 23:21:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-13 23:21:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4699 transitions. [2019-10-13 23:21:51,246 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4699 transitions. Word has length 55 [2019-10-13 23:21:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,248 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4699 transitions. [2019-10-13 23:21:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4699 transitions. [2019-10-13 23:21:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:21:51,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,257 INFO L380 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] [2019-10-13 23:21:51,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-10-13 23:21:51,258 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628486440] [2019-10-13 23:21:51,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628486440] [2019-10-13 23:21:51,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:51,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663140171] [2019-10-13 23:21:51,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:51,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:51,622 INFO L87 Difference]: Start difference. First operand 3574 states and 4699 transitions. Second operand 9 states. [2019-10-13 23:21:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:55,705 INFO L93 Difference]: Finished difference Result 5337 states and 7152 transitions. [2019-10-13 23:21:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:21:55,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 23:21:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:55,742 INFO L225 Difference]: With dead ends: 5337 [2019-10-13 23:21:55,742 INFO L226 Difference]: Without dead ends: 5332 [2019-10-13 23:21:55,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:21:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-10-13 23:21:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 3574. [2019-10-13 23:21:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-13 23:21:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4698 transitions. [2019-10-13 23:21:56,199 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4698 transitions. Word has length 56 [2019-10-13 23:21:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:56,201 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4698 transitions. [2019-10-13 23:21:56,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:21:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4698 transitions. [2019-10-13 23:21:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:21:56,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:56,207 INFO L380 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] [2019-10-13 23:21:56,207 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-10-13 23:21:56,208 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:56,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810834386] [2019-10-13 23:21:56,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:56,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810834386] [2019-10-13 23:21:56,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:56,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:56,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128077209] [2019-10-13 23:21:56,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:56,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:56,442 INFO L87 Difference]: Start difference. First operand 3574 states and 4698 transitions. Second operand 9 states. [2019-10-13 23:21:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:59,754 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-10-13 23:21:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:21:59,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 23:21:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:59,795 INFO L225 Difference]: With dead ends: 8465 [2019-10-13 23:21:59,795 INFO L226 Difference]: Without dead ends: 8171 [2019-10-13 23:21:59,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:21:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-10-13 23:22:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3574. [2019-10-13 23:22:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-13 23:22:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4697 transitions. [2019-10-13 23:22:00,207 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4697 transitions. Word has length 56 [2019-10-13 23:22:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:00,208 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4697 transitions. [2019-10-13 23:22:00,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4697 transitions. [2019-10-13 23:22:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:00,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:00,212 INFO L380 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] [2019-10-13 23:22:00,213 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-10-13 23:22:00,213 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:00,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683678059] [2019-10-13 23:22:00,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:00,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683678059] [2019-10-13 23:22:00,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:00,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:00,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592493322] [2019-10-13 23:22:00,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:00,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:00,393 INFO L87 Difference]: Start difference. First operand 3574 states and 4697 transitions. Second operand 8 states. [2019-10-13 23:22:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:02,871 INFO L93 Difference]: Finished difference Result 7606 states and 10513 transitions. [2019-10-13 23:22:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:02,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-13 23:22:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:02,903 INFO L225 Difference]: With dead ends: 7606 [2019-10-13 23:22:02,903 INFO L226 Difference]: Without dead ends: 6706 [2019-10-13 23:22:02,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:22:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-10-13 23:22:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 3574. [2019-10-13 23:22:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-13 23:22:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4696 transitions. [2019-10-13 23:22:03,136 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4696 transitions. Word has length 56 [2019-10-13 23:22:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:03,136 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4696 transitions. [2019-10-13 23:22:03,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4696 transitions. [2019-10-13 23:22:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:03,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:03,141 INFO L380 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] [2019-10-13 23:22:03,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-10-13 23:22:03,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:03,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028798042] [2019-10-13 23:22:03,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:03,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028798042] [2019-10-13 23:22:03,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:03,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:03,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422474489] [2019-10-13 23:22:03,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:03,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:03,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:03,216 INFO L87 Difference]: Start difference. First operand 3574 states and 4696 transitions. Second operand 3 states. [2019-10-13 23:22:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,673 INFO L93 Difference]: Finished difference Result 6645 states and 8841 transitions. [2019-10-13 23:22:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:03,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,698 INFO L225 Difference]: With dead ends: 6645 [2019-10-13 23:22:03,699 INFO L226 Difference]: Without dead ends: 4648 [2019-10-13 23:22:03,704 INFO L600 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-10-13 23:22:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2019-10-13 23:22:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 4642. [2019-10-13 23:22:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-10-13 23:22:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 5984 transitions. [2019-10-13 23:22:04,113 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 5984 transitions. Word has length 57 [2019-10-13 23:22:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:04,113 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 5984 transitions. [2019-10-13 23:22:04,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 5984 transitions. [2019-10-13 23:22:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:04,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:04,119 INFO L380 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] [2019-10-13 23:22:04,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-10-13 23:22:04,120 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:04,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119281725] [2019-10-13 23:22:04,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:04,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119281725] [2019-10-13 23:22:04,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:04,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:04,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082901905] [2019-10-13 23:22:04,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:04,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:04,217 INFO L87 Difference]: Start difference. First operand 4642 states and 5984 transitions. Second operand 3 states. [2019-10-13 23:22:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:04,703 INFO L93 Difference]: Finished difference Result 6703 states and 8942 transitions. [2019-10-13 23:22:04,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:04,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:04,714 INFO L225 Difference]: With dead ends: 6703 [2019-10-13 23:22:04,714 INFO L226 Difference]: Without dead ends: 5172 [2019-10-13 23:22:04,719 INFO L600 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-10-13 23:22:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-10-13 23:22:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4832. [2019-10-13 23:22:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2019-10-13 23:22:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 6302 transitions. [2019-10-13 23:22:05,169 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 6302 transitions. Word has length 57 [2019-10-13 23:22:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,172 INFO L462 AbstractCegarLoop]: Abstraction has 4832 states and 6302 transitions. [2019-10-13 23:22:05,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 6302 transitions. [2019-10-13 23:22:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:05,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,188 INFO L380 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] [2019-10-13 23:22:05,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-10-13 23:22:05,189 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508185298] [2019-10-13 23:22:05,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:05,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508185298] [2019-10-13 23:22:05,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:05,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175075799] [2019-10-13 23:22:05,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:05,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:05,276 INFO L87 Difference]: Start difference. First operand 4832 states and 6302 transitions. Second operand 3 states. [2019-10-13 23:22:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,987 INFO L93 Difference]: Finished difference Result 7920 states and 10691 transitions. [2019-10-13 23:22:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:05,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,999 INFO L225 Difference]: With dead ends: 7920 [2019-10-13 23:22:06,000 INFO L226 Difference]: Without dead ends: 5800 [2019-10-13 23:22:06,006 INFO L600 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-10-13 23:22:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2019-10-13 23:22:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5300. [2019-10-13 23:22:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5300 states. [2019-10-13 23:22:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6966 transitions. [2019-10-13 23:22:06,566 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6966 transitions. Word has length 57 [2019-10-13 23:22:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:06,566 INFO L462 AbstractCegarLoop]: Abstraction has 5300 states and 6966 transitions. [2019-10-13 23:22:06,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6966 transitions. [2019-10-13 23:22:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:06,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:06,572 INFO L380 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] [2019-10-13 23:22:06,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-10-13 23:22:06,575 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:06,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913470428] [2019-10-13 23:22:06,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:06,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913470428] [2019-10-13 23:22:06,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:06,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:06,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177820575] [2019-10-13 23:22:06,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:06,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:06,639 INFO L87 Difference]: Start difference. First operand 5300 states and 6966 transitions. Second operand 3 states. [2019-10-13 23:22:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:07,368 INFO L93 Difference]: Finished difference Result 9159 states and 12034 transitions. [2019-10-13 23:22:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:07,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:07,379 INFO L225 Difference]: With dead ends: 9159 [2019-10-13 23:22:07,379 INFO L226 Difference]: Without dead ends: 4419 [2019-10-13 23:22:07,395 INFO L600 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-10-13 23:22:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-10-13 23:22:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3526. [2019-10-13 23:22:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-10-13 23:22:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4545 transitions. [2019-10-13 23:22:07,913 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4545 transitions. Word has length 58 [2019-10-13 23:22:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 4545 transitions. [2019-10-13 23:22:07,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4545 transitions. [2019-10-13 23:22:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:07,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:07,922 INFO L380 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] [2019-10-13 23:22:07,923 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-10-13 23:22:07,923 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:07,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125115335] [2019-10-13 23:22:07,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:07,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125115335] [2019-10-13 23:22:07,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:07,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:07,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997546456] [2019-10-13 23:22:07,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:07,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:07,990 INFO L87 Difference]: Start difference. First operand 3526 states and 4545 transitions. Second operand 3 states. [2019-10-13 23:22:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:08,553 INFO L93 Difference]: Finished difference Result 5836 states and 7671 transitions. [2019-10-13 23:22:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:08,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:08,561 INFO L225 Difference]: With dead ends: 5836 [2019-10-13 23:22:08,561 INFO L226 Difference]: Without dead ends: 3278 [2019-10-13 23:22:08,566 INFO L600 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-10-13 23:22:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2019-10-13 23:22:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2660. [2019-10-13 23:22:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-13 23:22:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3401 transitions. [2019-10-13 23:22:08,869 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3401 transitions. Word has length 58 [2019-10-13 23:22:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:08,869 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3401 transitions. [2019-10-13 23:22:08,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3401 transitions. [2019-10-13 23:22:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:08,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:08,872 INFO L380 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] [2019-10-13 23:22:08,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-10-13 23:22:08,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:08,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985150141] [2019-10-13 23:22:08,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:08,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985150141] [2019-10-13 23:22:08,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:08,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:08,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581488657] [2019-10-13 23:22:08,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:08,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:08,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:08,940 INFO L87 Difference]: Start difference. First operand 2660 states and 3401 transitions. Second operand 3 states. [2019-10-13 23:22:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:09,332 INFO L93 Difference]: Finished difference Result 5481 states and 7239 transitions. [2019-10-13 23:22:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:09,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:09,339 INFO L225 Difference]: With dead ends: 5481 [2019-10-13 23:22:09,339 INFO L226 Difference]: Without dead ends: 3482 [2019-10-13 23:22:09,344 INFO L600 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-10-13 23:22:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states.