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 -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:14:13,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:14:13,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:14:13,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:14:13,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:14:13,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:14:13,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:14:13,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:14:13,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:14:13,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:14:13,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:14:13,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:14:13,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:14:13,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:14:13,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:14:13,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:14:13,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:14:13,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:14:13,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:14:13,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:14:13,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:14:13,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:14:13,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:14:13,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:14:13,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:14:13,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:14:13,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:14:13,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:14:13,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:14:13,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:14:13,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:14:13,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:14:13,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:14:13,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:14:13,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:14:13,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:14:13,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:14:13,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:14:13,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:14:13,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:14:13,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:14:13,651 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-09-08 12:14:13,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:14:13,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:14:13,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:14:13,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:14:13,673 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:14:13,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:14:13,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:14:13,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:14:13,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:14:13,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:14:13,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:14:13,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:14:13,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:14:13,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:14:13,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:14:13,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:14:13,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:14:13,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:14:13,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:14:13,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:14:13,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:14:13,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:14:13,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:14:13,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:14:13,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:14:13,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:14:13,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:14:13,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:14:13,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:14:13,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:14:13,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:14:13,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:14:13,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:14:13,735 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:14:13,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:14:13,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eb1a2a3/ee37014db82e4768a19a4cbc40898a75/FLAGb7cb81d46 [2019-09-08 12:14:14,328 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:14:14,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:14:14,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eb1a2a3/ee37014db82e4768a19a4cbc40898a75/FLAGb7cb81d46 [2019-09-08 12:14:14,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eb1a2a3/ee37014db82e4768a19a4cbc40898a75 [2019-09-08 12:14:14,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:14:14,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:14:14,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:14:14,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:14:14,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:14:14,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:14:14" (1/1) ... [2019-09-08 12:14:14,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fefb0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:14, skipping insertion in model container [2019-09-08 12:14:14,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:14:14" (1/1) ... [2019-09-08 12:14:14,682 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:14:14,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:14:15,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:14:15,220 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:14:15,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:14:15,374 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:14:15,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15 WrapperNode [2019-09-08 12:14:15,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:14:15,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:14:15,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:14:15,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:14:15,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (1/1) ... [2019-09-08 12:14:15,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:14:15,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:14:15,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:14:15,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:14:15,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (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-08 12:14:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:14:15,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:14:15,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:14:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:14:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:14:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:14:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:14:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:14:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:14:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:14:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:14:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:14:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:14:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:14:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:14:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:14:16,353 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:14:16,353 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:14:16,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:14:16 BoogieIcfgContainer [2019-09-08 12:14:16,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:14:16,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:14:16,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:14:16,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:14:16,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:14:14" (1/3) ... [2019-09-08 12:14:16,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced2f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:14:16, skipping insertion in model container [2019-09-08 12:14:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:14:15" (2/3) ... [2019-09-08 12:14:16,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced2f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:14:16, skipping insertion in model container [2019-09-08 12:14:16,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:14:16" (3/3) ... [2019-09-08 12:14:16,364 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:14:16,374 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:14:16,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:14:16,402 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:14:16,435 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:14:16,435 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:14:16,435 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:14:16,436 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:14:16,436 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:14:16,436 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:14:16,436 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:14:16,436 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:14:16,437 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:14:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:14:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:14:16,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:16,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:16,470 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1568218155, now seen corresponding path program 1 times [2019-09-08 12:14:16,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:16,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:16,986 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-08 12:14:16,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:16,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:16,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:17,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:17,011 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:14:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:17,166 INFO L93 Difference]: Finished difference Result 301 states and 494 transitions. [2019-09-08 12:14:17,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:17,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:14:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:17,183 INFO L225 Difference]: With dead ends: 301 [2019-09-08 12:14:17,183 INFO L226 Difference]: Without dead ends: 228 [2019-09-08 12:14:17,187 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-08 12:14:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-08 12:14:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-09-08 12:14:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 326 transitions. [2019-09-08 12:14:17,269 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 326 transitions. Word has length 79 [2019-09-08 12:14:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:17,273 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 326 transitions. [2019-09-08 12:14:17,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 326 transitions. [2019-09-08 12:14:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:14:17,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:17,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:17,278 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1951668189, now seen corresponding path program 1 times [2019-09-08 12:14:17,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:17,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:17,545 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-08 12:14:17,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:17,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:17,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:17,548 INFO L87 Difference]: Start difference. First operand 226 states and 326 transitions. Second operand 5 states. [2019-09-08 12:14:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:17,788 INFO L93 Difference]: Finished difference Result 411 states and 610 transitions. [2019-09-08 12:14:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:17,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:14:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:17,792 INFO L225 Difference]: With dead ends: 411 [2019-09-08 12:14:17,792 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:14:17,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:14:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 12:14:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2019-09-08 12:14:17,818 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 81 [2019-09-08 12:14:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:17,819 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2019-09-08 12:14:17,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2019-09-08 12:14:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:14:17,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:17,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:17,821 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash 573425260, now seen corresponding path program 1 times [2019-09-08 12:14:17,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:17,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:17,984 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-08 12:14:17,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:17,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:17,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:17,987 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand 5 states. [2019-09-08 12:14:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:18,216 INFO L93 Difference]: Finished difference Result 407 states and 600 transitions. [2019-09-08 12:14:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:18,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:14:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:18,218 INFO L225 Difference]: With dead ends: 407 [2019-09-08 12:14:18,219 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:14:18,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:14:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 12:14:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 320 transitions. [2019-09-08 12:14:18,239 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 320 transitions. Word has length 82 [2019-09-08 12:14:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:18,239 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 320 transitions. [2019-09-08 12:14:18,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2019-09-08 12:14:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:14:18,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:18,242 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] [2019-09-08 12:14:18,242 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -263686482, now seen corresponding path program 1 times [2019-09-08 12:14:18,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:18,345 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-08 12:14:18,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:18,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:18,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:18,347 INFO L87 Difference]: Start difference. First operand 226 states and 320 transitions. Second operand 5 states. [2019-09-08 12:14:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:18,528 INFO L93 Difference]: Finished difference Result 399 states and 585 transitions. [2019-09-08 12:14:18,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:18,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 12:14:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:18,530 INFO L225 Difference]: With dead ends: 399 [2019-09-08 12:14:18,531 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:14:18,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:14:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 12:14:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2019-09-08 12:14:18,558 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 83 [2019-09-08 12:14:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:18,558 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2019-09-08 12:14:18,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2019-09-08 12:14:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:14:18,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:18,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:18,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -601320308, now seen corresponding path program 1 times [2019-09-08 12:14:18,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:18,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:18,719 INFO L87 Difference]: Start difference. First operand 226 states and 317 transitions. Second operand 5 states. [2019-09-08 12:14:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:18,923 INFO L93 Difference]: Finished difference Result 395 states and 575 transitions. [2019-09-08 12:14:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:18,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 12:14:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:18,928 INFO L225 Difference]: With dead ends: 395 [2019-09-08 12:14:18,929 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:14:18,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:14:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 12:14:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2019-09-08 12:14:18,952 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 84 [2019-09-08 12:14:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:18,953 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2019-09-08 12:14:18,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2019-09-08 12:14:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:14:18,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:18,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:18,957 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2143300643, now seen corresponding path program 1 times [2019-09-08 12:14:18,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:18,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:18,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:19,107 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-08 12:14:19,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:19,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:19,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:19,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:19,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:19,109 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand 5 states. [2019-09-08 12:14:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:19,286 INFO L93 Difference]: Finished difference Result 403 states and 578 transitions. [2019-09-08 12:14:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:19,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:14:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:19,290 INFO L225 Difference]: With dead ends: 403 [2019-09-08 12:14:19,290 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:14:19,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:14:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 12:14:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:14:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 311 transitions. [2019-09-08 12:14:19,306 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 311 transitions. Word has length 85 [2019-09-08 12:14:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:19,308 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 311 transitions. [2019-09-08 12:14:19,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 311 transitions. [2019-09-08 12:14:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:19,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:19,310 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] [2019-09-08 12:14:19,310 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1319224778, now seen corresponding path program 1 times [2019-09-08 12:14:19,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:19,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:19,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:19,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:19,508 INFO L87 Difference]: Start difference. First operand 226 states and 311 transitions. Second operand 7 states. [2019-09-08 12:14:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:19,770 INFO L93 Difference]: Finished difference Result 879 states and 1290 transitions. [2019-09-08 12:14:19,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:14:19,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 12:14:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:19,777 INFO L225 Difference]: With dead ends: 879 [2019-09-08 12:14:19,797 INFO L226 Difference]: Without dead ends: 763 [2019-09-08 12:14:19,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:14:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-08 12:14:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 285. [2019-09-08 12:14:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-08 12:14:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 401 transitions. [2019-09-08 12:14:19,832 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 401 transitions. Word has length 86 [2019-09-08 12:14:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:19,833 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 401 transitions. [2019-09-08 12:14:19,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 401 transitions. [2019-09-08 12:14:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:19,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:19,834 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] [2019-09-08 12:14:19,834 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1049546299, now seen corresponding path program 1 times [2019-09-08 12:14:19,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:19,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:19,949 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-08 12:14:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:19,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:19,951 INFO L87 Difference]: Start difference. First operand 285 states and 401 transitions. Second operand 5 states. [2019-09-08 12:14:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:20,103 INFO L93 Difference]: Finished difference Result 632 states and 923 transitions. [2019-09-08 12:14:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:20,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:14:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:20,108 INFO L225 Difference]: With dead ends: 632 [2019-09-08 12:14:20,108 INFO L226 Difference]: Without dead ends: 516 [2019-09-08 12:14:20,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:14:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-08 12:14:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 430. [2019-09-08 12:14:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-08 12:14:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 623 transitions. [2019-09-08 12:14:20,166 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 623 transitions. Word has length 86 [2019-09-08 12:14:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:20,166 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 623 transitions. [2019-09-08 12:14:20,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 623 transitions. [2019-09-08 12:14:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:20,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:20,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:20,169 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash 992840357, now seen corresponding path program 1 times [2019-09-08 12:14:20,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:20,336 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-08 12:14:20,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:20,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:20,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:20,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:20,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:20,337 INFO L87 Difference]: Start difference. First operand 430 states and 623 transitions. Second operand 7 states. [2019-09-08 12:14:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:20,631 INFO L93 Difference]: Finished difference Result 1338 states and 1991 transitions. [2019-09-08 12:14:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:14:20,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 12:14:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:20,639 INFO L225 Difference]: With dead ends: 1338 [2019-09-08 12:14:20,639 INFO L226 Difference]: Without dead ends: 1163 [2019-09-08 12:14:20,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:14:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-09-08 12:14:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 608. [2019-09-08 12:14:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 12:14:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 894 transitions. [2019-09-08 12:14:20,737 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 894 transitions. Word has length 86 [2019-09-08 12:14:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:20,738 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 894 transitions. [2019-09-08 12:14:20,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 894 transitions. [2019-09-08 12:14:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:20,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:20,740 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] [2019-09-08 12:14:20,740 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 977114007, now seen corresponding path program 1 times [2019-09-08 12:14:20,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:20,798 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-08 12:14:20,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:20,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:20,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:20,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:20,799 INFO L87 Difference]: Start difference. First operand 608 states and 894 transitions. Second operand 3 states. [2019-09-08 12:14:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:20,966 INFO L93 Difference]: Finished difference Result 1499 states and 2232 transitions. [2019-09-08 12:14:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:20,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 12:14:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:20,978 INFO L225 Difference]: With dead ends: 1499 [2019-09-08 12:14:20,979 INFO L226 Difference]: Without dead ends: 1029 [2019-09-08 12:14:20,981 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-08 12:14:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-08 12:14:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1011. [2019-09-08 12:14:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-09-08 12:14:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1479 transitions. [2019-09-08 12:14:21,149 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1479 transitions. Word has length 86 [2019-09-08 12:14:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:21,149 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1479 transitions. [2019-09-08 12:14:21,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1479 transitions. [2019-09-08 12:14:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:21,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:21,152 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] [2019-09-08 12:14:21,152 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1184012502, now seen corresponding path program 1 times [2019-09-08 12:14:21,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:21,227 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-08 12:14:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:21,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:21,229 INFO L87 Difference]: Start difference. First operand 1011 states and 1479 transitions. Second operand 3 states. [2019-09-08 12:14:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:21,431 INFO L93 Difference]: Finished difference Result 1995 states and 2941 transitions. [2019-09-08 12:14:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:21,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 12:14:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:21,438 INFO L225 Difference]: With dead ends: 1995 [2019-09-08 12:14:21,439 INFO L226 Difference]: Without dead ends: 1122 [2019-09-08 12:14:21,442 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-08 12:14:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-09-08 12:14:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1120. [2019-09-08 12:14:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-09-08 12:14:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1633 transitions. [2019-09-08 12:14:21,590 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1633 transitions. Word has length 86 [2019-09-08 12:14:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:21,591 INFO L475 AbstractCegarLoop]: Abstraction has 1120 states and 1633 transitions. [2019-09-08 12:14:21,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1633 transitions. [2019-09-08 12:14:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:21,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:21,592 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] [2019-09-08 12:14:21,592 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 16626912, now seen corresponding path program 1 times [2019-09-08 12:14:21,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:21,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:21,693 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-08 12:14:21,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:21,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:21,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:21,695 INFO L87 Difference]: Start difference. First operand 1120 states and 1633 transitions. Second operand 5 states. [2019-09-08 12:14:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:22,034 INFO L93 Difference]: Finished difference Result 1809 states and 2649 transitions. [2019-09-08 12:14:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:22,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:14:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:22,044 INFO L225 Difference]: With dead ends: 1809 [2019-09-08 12:14:22,044 INFO L226 Difference]: Without dead ends: 1375 [2019-09-08 12:14:22,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:14:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2019-09-08 12:14:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1235. [2019-09-08 12:14:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-09-08 12:14:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1804 transitions. [2019-09-08 12:14:22,285 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1804 transitions. Word has length 86 [2019-09-08 12:14:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:22,285 INFO L475 AbstractCegarLoop]: Abstraction has 1235 states and 1804 transitions. [2019-09-08 12:14:22,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1804 transitions. [2019-09-08 12:14:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:14:22,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:22,287 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] [2019-09-08 12:14:22,287 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 379433169, now seen corresponding path program 1 times [2019-09-08 12:14:22,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:22,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:22,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:22,399 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-08 12:14:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:14:22,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:14:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:14:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:14:22,402 INFO L87 Difference]: Start difference. First operand 1235 states and 1804 transitions. Second operand 5 states. [2019-09-08 12:14:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:22,684 INFO L93 Difference]: Finished difference Result 2614 states and 3846 transitions. [2019-09-08 12:14:22,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:14:22,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:14:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:22,695 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:14:22,696 INFO L226 Difference]: Without dead ends: 2071 [2019-09-08 12:14:22,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:14:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-09-08 12:14:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2022. [2019-09-08 12:14:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2974 transitions. [2019-09-08 12:14:22,936 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2974 transitions. Word has length 86 [2019-09-08 12:14:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:22,937 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2974 transitions. [2019-09-08 12:14:22,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:14:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2974 transitions. [2019-09-08 12:14:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:14:22,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:22,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:22,939 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 422232126, now seen corresponding path program 1 times [2019-09-08 12:14:22,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:23,230 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-08 12:14:23,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:23,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:14:23,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:14:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:14:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:14:23,233 INFO L87 Difference]: Start difference. First operand 2022 states and 2974 transitions. Second operand 9 states. [2019-09-08 12:14:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:24,474 INFO L93 Difference]: Finished difference Result 5797 states and 8569 transitions. [2019-09-08 12:14:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:14:24,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:14:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:24,496 INFO L225 Difference]: With dead ends: 5797 [2019-09-08 12:14:24,496 INFO L226 Difference]: Without dead ends: 3880 [2019-09-08 12:14:24,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:14:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2019-09-08 12:14:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 2022. [2019-09-08 12:14:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2973 transitions. [2019-09-08 12:14:24,809 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2973 transitions. Word has length 87 [2019-09-08 12:14:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:24,809 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2973 transitions. [2019-09-08 12:14:24,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:14:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2973 transitions. [2019-09-08 12:14:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:14:24,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:24,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:24,812 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash -16144864, now seen corresponding path program 1 times [2019-09-08 12:14:24,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:24,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:25,050 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-08 12:14:25,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:25,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:14:25,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:14:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:14:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:14:25,052 INFO L87 Difference]: Start difference. First operand 2022 states and 2973 transitions. Second operand 10 states. [2019-09-08 12:14:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:26,555 INFO L93 Difference]: Finished difference Result 5925 states and 8732 transitions. [2019-09-08 12:14:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:14:26,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 12:14:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:26,574 INFO L225 Difference]: With dead ends: 5925 [2019-09-08 12:14:26,575 INFO L226 Difference]: Without dead ends: 4007 [2019-09-08 12:14:26,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:14:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2019-09-08 12:14:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 2022. [2019-09-08 12:14:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2971 transitions. [2019-09-08 12:14:26,944 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2971 transitions. Word has length 88 [2019-09-08 12:14:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:26,944 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2971 transitions. [2019-09-08 12:14:26,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:14:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2971 transitions. [2019-09-08 12:14:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:14:26,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:26,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:26,946 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1990597379, now seen corresponding path program 1 times [2019-09-08 12:14:26,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:26,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:27,163 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-08 12:14:27,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:27,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:14:27,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:14:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:14:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:14:27,165 INFO L87 Difference]: Start difference. First operand 2022 states and 2971 transitions. Second operand 10 states. [2019-09-08 12:14:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:28,525 INFO L93 Difference]: Finished difference Result 5836 states and 8587 transitions. [2019-09-08 12:14:28,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:14:28,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 12:14:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:28,543 INFO L225 Difference]: With dead ends: 5836 [2019-09-08 12:14:28,543 INFO L226 Difference]: Without dead ends: 3978 [2019-09-08 12:14:28,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:14:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-09-08 12:14:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 2022. [2019-09-08 12:14:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2964 transitions. [2019-09-08 12:14:28,880 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2964 transitions. Word has length 88 [2019-09-08 12:14:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:28,880 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2964 transitions. [2019-09-08 12:14:28,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:14:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2964 transitions. [2019-09-08 12:14:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:14:28,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:28,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:28,883 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2138935051, now seen corresponding path program 1 times [2019-09-08 12:14:28,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:28,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:28,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:29,105 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-08 12:14:29,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:29,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:14:29,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:14:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:14:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:14:29,107 INFO L87 Difference]: Start difference. First operand 2022 states and 2964 transitions. Second operand 10 states. [2019-09-08 12:14:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:30,602 INFO L93 Difference]: Finished difference Result 5916 states and 8696 transitions. [2019-09-08 12:14:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:14:30,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 12:14:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:30,622 INFO L225 Difference]: With dead ends: 5916 [2019-09-08 12:14:30,622 INFO L226 Difference]: Without dead ends: 4008 [2019-09-08 12:14:30,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:14:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2019-09-08 12:14:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 2022. [2019-09-08 12:14:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2960 transitions. [2019-09-08 12:14:30,978 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2960 transitions. Word has length 89 [2019-09-08 12:14:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:30,979 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2960 transitions. [2019-09-08 12:14:30,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:14:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2960 transitions. [2019-09-08 12:14:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:14:30,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:30,980 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-08 12:14:30,980 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1852033779, now seen corresponding path program 1 times [2019-09-08 12:14:30,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:30,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:31,187 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-08 12:14:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:14:31,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:14:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:14:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:14:31,189 INFO L87 Difference]: Start difference. First operand 2022 states and 2960 transitions. Second operand 10 states. [2019-09-08 12:14:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:32,622 INFO L93 Difference]: Finished difference Result 5886 states and 8644 transitions. [2019-09-08 12:14:32,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:14:32,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 12:14:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:32,642 INFO L225 Difference]: With dead ends: 5886 [2019-09-08 12:14:32,642 INFO L226 Difference]: Without dead ends: 3998 [2019-09-08 12:14:32,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:14:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2019-09-08 12:14:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 2022. [2019-09-08 12:14:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 12:14:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2954 transitions. [2019-09-08 12:14:32,922 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2954 transitions. Word has length 90 [2019-09-08 12:14:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:32,923 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2954 transitions. [2019-09-08 12:14:32,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:14:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2954 transitions. [2019-09-08 12:14:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:32,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:32,924 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-08 12:14:32,924 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 913180287, now seen corresponding path program 1 times [2019-09-08 12:14:32,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:32,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:34,057 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-08 12:14:34,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:14:34,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:14:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:14:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:14:34,059 INFO L87 Difference]: Start difference. First operand 2022 states and 2954 transitions. Second operand 18 states. [2019-09-08 12:14:34,718 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 12:14:34,934 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:14:35,220 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:14:35,391 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:14:35,566 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:14:35,731 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:14:36,278 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:14:36,536 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:14:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:39,245 INFO L93 Difference]: Finished difference Result 17503 states and 25879 transitions. [2019-09-08 12:14:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:14:39,246 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-08 12:14:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:39,280 INFO L225 Difference]: With dead ends: 17503 [2019-09-08 12:14:39,281 INFO L226 Difference]: Without dead ends: 15978 [2019-09-08 12:14:39,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:14:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2019-09-08 12:14:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 2082. [2019-09-08 12:14:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-09-08 12:14:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3031 transitions. [2019-09-08 12:14:39,919 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3031 transitions. Word has length 91 [2019-09-08 12:14:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:39,919 INFO L475 AbstractCegarLoop]: Abstraction has 2082 states and 3031 transitions. [2019-09-08 12:14:39,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:14:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3031 transitions. [2019-09-08 12:14:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:39,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:39,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:39,921 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 107830048, now seen corresponding path program 1 times [2019-09-08 12:14:39,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:39,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:40,868 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-08 12:14:40,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:14:40,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:14:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:14:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:14:40,870 INFO L87 Difference]: Start difference. First operand 2082 states and 3031 transitions. Second operand 19 states. [2019-09-08 12:14:41,507 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:14:41,705 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:14:41,997 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:14:42,340 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:14:42,529 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:14:42,924 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:14:43,215 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:14:43,381 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:14:43,630 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:14:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:46,329 INFO L93 Difference]: Finished difference Result 12045 states and 17769 transitions. [2019-09-08 12:14:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:14:46,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-09-08 12:14:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:46,352 INFO L225 Difference]: With dead ends: 12045 [2019-09-08 12:14:46,352 INFO L226 Difference]: Without dead ends: 10470 [2019-09-08 12:14:46,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:14:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10470 states. [2019-09-08 12:14:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10470 to 2072. [2019-09-08 12:14:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2019-09-08 12:14:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3011 transitions. [2019-09-08 12:14:47,231 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3011 transitions. Word has length 91 [2019-09-08 12:14:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:47,232 INFO L475 AbstractCegarLoop]: Abstraction has 2072 states and 3011 transitions. [2019-09-08 12:14:47,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:14:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3011 transitions. [2019-09-08 12:14:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:47,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:47,234 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-08 12:14:47,235 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1201313119, now seen corresponding path program 1 times [2019-09-08 12:14:47,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:48,490 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:14:48,688 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:14:53,112 WARN L188 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:14:53,706 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:14:53,854 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:14:54,285 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2019-09-08 12:14:54,877 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-08 12:14:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:14:54,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:14:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:14:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:14:54,879 INFO L87 Difference]: Start difference. First operand 2072 states and 3011 transitions. Second operand 30 states. [2019-09-08 12:14:55,034 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:14:56,228 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:14:56,506 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:14:56,861 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-08 12:14:57,264 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2019-09-08 12:14:57,890 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-09-08 12:15:15,670 WARN L188 SmtUtils]: Spent 17.67 s on a formula simplification. DAG size of input: 164 DAG size of output: 136 [2019-09-08 12:15:26,859 WARN L188 SmtUtils]: Spent 11.10 s on a formula simplification. DAG size of input: 189 DAG size of output: 159 [2019-09-08 12:15:43,709 WARN L188 SmtUtils]: Spent 16.75 s on a formula simplification. DAG size of input: 204 DAG size of output: 174 [2019-09-08 12:15:43,971 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:15:44,221 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:15:44,612 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:15:45,082 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:15:45,554 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 12:15:46,391 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 12:15:46,998 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:15:47,312 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 12:15:47,826 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 12:15:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:55,878 INFO L93 Difference]: Finished difference Result 15953 states and 23545 transitions. [2019-09-08 12:15:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:15:55,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-08 12:15:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:55,910 INFO L225 Difference]: With dead ends: 15953 [2019-09-08 12:15:55,910 INFO L226 Difference]: Without dead ends: 14647 [2019-09-08 12:15:55,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=789, Invalid=3371, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:15:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14647 states. [2019-09-08 12:15:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14647 to 2114. [2019-09-08 12:15:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-09-08 12:15:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3065 transitions. [2019-09-08 12:15:56,913 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3065 transitions. Word has length 91 [2019-09-08 12:15:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:56,915 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 3065 transitions. [2019-09-08 12:15:56,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:15:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3065 transitions. [2019-09-08 12:15:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:15:56,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:56,917 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-08 12:15:56,918 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 435359808, now seen corresponding path program 1 times [2019-09-08 12:15:56,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:56,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:56,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:57,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:57,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:15:57,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:15:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:15:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:15:57,741 INFO L87 Difference]: Start difference. First operand 2114 states and 3065 transitions. Second operand 17 states. [2019-09-08 12:15:58,392 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:15:58,555 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:15:58,799 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:15:58,969 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:15:59,145 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:15:59,373 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:15:59,511 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:15:59,679 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:16:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:03,013 INFO L93 Difference]: Finished difference Result 8888 states and 13093 transitions. [2019-09-08 12:16:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:16:03,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-09-08 12:16:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:03,026 INFO L225 Difference]: With dead ends: 8888 [2019-09-08 12:16:03,026 INFO L226 Difference]: Without dead ends: 8090 [2019-09-08 12:16:03,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:16:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2019-09-08 12:16:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 2090. [2019-09-08 12:16:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-09-08 12:16:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 3033 transitions. [2019-09-08 12:16:03,903 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 3033 transitions. Word has length 91 [2019-09-08 12:16:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:03,903 INFO L475 AbstractCegarLoop]: Abstraction has 2090 states and 3033 transitions. [2019-09-08 12:16:03,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3033 transitions. [2019-09-08 12:16:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:16:03,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:03,905 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-08 12:16:03,905 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 188709021, now seen corresponding path program 1 times [2019-09-08 12:16:03,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:03,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:04,604 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-08 12:16:04,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:04,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:16:04,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:16:04,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:16:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:16:04,606 INFO L87 Difference]: Start difference. First operand 2090 states and 3033 transitions. Second operand 14 states. [2019-09-08 12:16:05,195 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:16:05,473 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:16:05,760 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:16:06,220 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:16:06,619 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:16:06,789 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:16:07,878 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 12:16:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:10,933 INFO L93 Difference]: Finished difference Result 12780 states and 18848 transitions. [2019-09-08 12:16:10,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:16:10,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2019-09-08 12:16:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:10,944 INFO L225 Difference]: With dead ends: 12780 [2019-09-08 12:16:10,945 INFO L226 Difference]: Without dead ends: 11425 [2019-09-08 12:16:10,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:16:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-09-08 12:16:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 2055. [2019-09-08 12:16:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-09-08 12:16:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2982 transitions. [2019-09-08 12:16:11,761 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2982 transitions. Word has length 92 [2019-09-08 12:16:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:11,762 INFO L475 AbstractCegarLoop]: Abstraction has 2055 states and 2982 transitions. [2019-09-08 12:16:11,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:16:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2982 transitions. [2019-09-08 12:16:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:16:11,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:11,763 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-08 12:16:11,763 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -596964940, now seen corresponding path program 1 times [2019-09-08 12:16:11,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:11,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:11,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:11,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:11,912 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-08 12:16:11,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:16:11,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:16:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:16:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:16:11,914 INFO L87 Difference]: Start difference. First operand 2055 states and 2982 transitions. Second operand 4 states. [2019-09-08 12:16:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:13,120 INFO L93 Difference]: Finished difference Result 4811 states and 7069 transitions. [2019-09-08 12:16:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:13,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 12:16:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:13,124 INFO L225 Difference]: With dead ends: 4811 [2019-09-08 12:16:13,124 INFO L226 Difference]: Without dead ends: 2960 [2019-09-08 12:16:13,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-09-08 12:16:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2941. [2019-09-08 12:16:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2941 states. [2019-09-08 12:16:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4270 transitions. [2019-09-08 12:16:14,100 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4270 transitions. Word has length 92 [2019-09-08 12:16:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:14,101 INFO L475 AbstractCegarLoop]: Abstraction has 2941 states and 4270 transitions. [2019-09-08 12:16:14,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:16:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4270 transitions. [2019-09-08 12:16:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:16:14,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:14,102 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-08 12:16:14,102 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1323542840, now seen corresponding path program 1 times [2019-09-08 12:16:14,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:14,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:14,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:14,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:14,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:14,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:14,176 INFO L87 Difference]: Start difference. First operand 2941 states and 4270 transitions. Second operand 5 states. [2019-09-08 12:16:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:15,856 INFO L93 Difference]: Finished difference Result 4580 states and 6668 transitions. [2019-09-08 12:16:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:16:15,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:16:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:15,860 INFO L225 Difference]: With dead ends: 4580 [2019-09-08 12:16:15,860 INFO L226 Difference]: Without dead ends: 4578 [2019-09-08 12:16:15,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:16:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2019-09-08 12:16:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 2959. [2019-09-08 12:16:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-09-08 12:16:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4276 transitions. [2019-09-08 12:16:16,789 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4276 transitions. Word has length 92 [2019-09-08 12:16:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:16,789 INFO L475 AbstractCegarLoop]: Abstraction has 2959 states and 4276 transitions. [2019-09-08 12:16:16,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4276 transitions. [2019-09-08 12:16:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:16:16,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:16,790 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-08 12:16:16,790 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1094426183, now seen corresponding path program 1 times [2019-09-08 12:16:16,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:16,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:16,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:16,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:17,814 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-08 12:16:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:16:17,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:16:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:16:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:16:17,816 INFO L87 Difference]: Start difference. First operand 2959 states and 4276 transitions. Second operand 19 states. [2019-09-08 12:16:18,398 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:16:18,617 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:16:19,034 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-08 12:16:19,467 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-09-08 12:16:19,650 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:16:20,083 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:16:20,402 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:16:20,580 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:16:20,848 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:16:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:26,373 INFO L93 Difference]: Finished difference Result 15902 states and 23258 transitions. [2019-09-08 12:16:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:16:26,374 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-08 12:16:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:26,388 INFO L225 Difference]: With dead ends: 15902 [2019-09-08 12:16:26,388 INFO L226 Difference]: Without dead ends: 14064 [2019-09-08 12:16:26,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:16:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14064 states. [2019-09-08 12:16:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14064 to 2935. [2019-09-08 12:16:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2935 states. [2019-09-08 12:16:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4243 transitions. [2019-09-08 12:16:27,476 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4243 transitions. Word has length 92 [2019-09-08 12:16:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:27,477 INFO L475 AbstractCegarLoop]: Abstraction has 2935 states and 4243 transitions. [2019-09-08 12:16:27,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:16:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4243 transitions. [2019-09-08 12:16:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:16:27,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:27,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:27,479 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1433027713, now seen corresponding path program 1 times [2019-09-08 12:16:27,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:27,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:28,520 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:16:28,759 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:16:28,899 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:16:29,094 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-08 12:16:29,409 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:16:29,616 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:16:29,804 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 12:16:30,000 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:16:30,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-08 12:16:30,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:30,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:16:30,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:16:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:16:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:16:30,891 INFO L87 Difference]: Start difference. First operand 2935 states and 4243 transitions. Second operand 32 states. [2019-09-08 12:16:31,168 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-08 12:16:31,973 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-08 12:16:32,166 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-08 12:16:32,405 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:16:32,644 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:16:32,991 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:16:33,685 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:16:34,239 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-08 12:16:35,057 WARN L188 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-08 12:16:35,907 WARN L188 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 103 [2019-09-08 12:16:36,873 WARN L188 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-09-08 12:16:37,950 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 120 [2019-09-08 12:16:39,095 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-09-08 12:16:40,403 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 175 DAG size of output: 141 [2019-09-08 12:16:41,005 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-08 12:16:41,602 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-08 12:16:41,943 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-08 12:16:42,655 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 107 [2019-09-08 12:16:42,917 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-08 12:16:43,494 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-08 12:16:43,745 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-08 12:16:44,102 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:16:44,683 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-08 12:16:45,030 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:16:45,220 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 12:16:45,557 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 12:16:46,073 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:16:46,355 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 12:16:47,076 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:16:47,670 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:17:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:07,110 INFO L93 Difference]: Finished difference Result 35652 states and 52210 transitions. [2019-09-08 12:17:07,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:17:07,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-08 12:17:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:07,146 INFO L225 Difference]: With dead ends: 35652 [2019-09-08 12:17:07,146 INFO L226 Difference]: Without dead ends: 33749 [2019-09-08 12:17:07,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=789, Invalid=4041, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 12:17:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33749 states. [2019-09-08 12:17:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33749 to 2939. [2019-09-08 12:17:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2939 states. [2019-09-08 12:17:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 4247 transitions. [2019-09-08 12:17:08,719 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 4247 transitions. Word has length 93 [2019-09-08 12:17:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:08,719 INFO L475 AbstractCegarLoop]: Abstraction has 2939 states and 4247 transitions. [2019-09-08 12:17:08,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:17:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 4247 transitions. [2019-09-08 12:17:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:17:08,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:08,721 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-08 12:17:08,721 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 130994276, now seen corresponding path program 1 times [2019-09-08 12:17:08,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:09,195 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:17:09,412 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-08 12:17:09,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:09,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:17:09,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:17:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:17:09,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:17:09,413 INFO L87 Difference]: Start difference. First operand 2939 states and 4247 transitions. Second operand 14 states. [2019-09-08 12:17:09,948 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:17:10,132 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:17:10,336 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:17:10,725 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:17:11,030 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:17:11,201 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:17:12,829 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:17:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:19,341 INFO L93 Difference]: Finished difference Result 18627 states and 27228 transitions. [2019-09-08 12:17:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:17:19,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2019-09-08 12:17:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:19,359 INFO L225 Difference]: With dead ends: 18627 [2019-09-08 12:17:19,359 INFO L226 Difference]: Without dead ends: 16774 [2019-09-08 12:17:19,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:17:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2019-09-08 12:17:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 2922. [2019-09-08 12:17:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-09-08 12:17:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4225 transitions. [2019-09-08 12:17:20,880 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4225 transitions. Word has length 93 [2019-09-08 12:17:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:20,880 INFO L475 AbstractCegarLoop]: Abstraction has 2922 states and 4225 transitions. [2019-09-08 12:17:20,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:17:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4225 transitions. [2019-09-08 12:17:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:17:20,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:20,882 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-08 12:17:20,882 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2117744673, now seen corresponding path program 1 times [2019-09-08 12:17:20,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:20,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:20,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:20,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:20,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:21,693 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:17:22,507 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:17:23,206 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-08 12:17:23,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:17:23,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:17:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:17:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:17:23,208 INFO L87 Difference]: Start difference. First operand 2922 states and 4225 transitions. Second operand 32 states. [2019-09-08 12:17:23,398 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:17:24,313 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 12:17:24,559 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:17:24,918 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 12:17:25,202 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-08 12:17:25,585 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-08 12:17:26,028 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-08 12:17:26,523 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-08 12:17:27,121 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2019-09-08 12:17:27,783 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2019-09-08 12:17:28,646 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 124 [2019-09-08 12:17:28,923 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 12:17:29,200 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-08 12:17:29,593 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 12:17:29,968 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-08 12:17:30,251 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:17:30,601 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:17:30,797 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:17:31,125 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:17:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:50,979 INFO L93 Difference]: Finished difference Result 31266 states and 45753 transitions. [2019-09-08 12:17:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:17:50,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-08 12:17:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:51,010 INFO L225 Difference]: With dead ends: 31266 [2019-09-08 12:17:51,010 INFO L226 Difference]: Without dead ends: 30131 [2019-09-08 12:17:51,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=720, Invalid=3186, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 12:17:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30131 states. [2019-09-08 12:17:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30131 to 2930. [2019-09-08 12:17:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2019-09-08 12:17:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4234 transitions. [2019-09-08 12:17:52,689 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4234 transitions. Word has length 93 [2019-09-08 12:17:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:52,689 INFO L475 AbstractCegarLoop]: Abstraction has 2930 states and 4234 transitions. [2019-09-08 12:17:52,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:17:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4234 transitions. [2019-09-08 12:17:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:17:52,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:52,691 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:52,691 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash 574389371, now seen corresponding path program 1 times [2019-09-08 12:17:52,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:53,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:53,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:17:53,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:17:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:17:53,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:17:53,721 INFO L87 Difference]: Start difference. First operand 2930 states and 4234 transitions. Second operand 18 states. [2019-09-08 12:17:54,424 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 12:17:54,615 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 12:17:54,849 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-08 12:17:55,043 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 12:17:55,257 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 12:17:55,440 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 12:17:55,657 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 12:17:55,933 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:17:56,184 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-08 12:18:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:10,961 INFO L93 Difference]: Finished difference Result 27058 states and 39680 transitions. [2019-09-08 12:18:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:18:10,962 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-08 12:18:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:10,988 INFO L225 Difference]: With dead ends: 27058 [2019-09-08 12:18:10,989 INFO L226 Difference]: Without dead ends: 25139 [2019-09-08 12:18:10,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:18:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25139 states. [2019-09-08 12:18:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25139 to 2914. [2019-09-08 12:18:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2019-09-08 12:18:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 4214 transitions. [2019-09-08 12:18:12,794 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 4214 transitions. Word has length 93 [2019-09-08 12:18:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:12,795 INFO L475 AbstractCegarLoop]: Abstraction has 2914 states and 4214 transitions. [2019-09-08 12:18:12,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:18:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 4214 transitions. [2019-09-08 12:18:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:18:12,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:12,795 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-08 12:18:12,796 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 492231610, now seen corresponding path program 1 times [2019-09-08 12:18:12,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:13,305 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-08 12:18:13,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:18:13,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:18:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:18:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:18:13,307 INFO L87 Difference]: Start difference. First operand 2914 states and 4214 transitions. Second operand 13 states. [2019-09-08 12:18:13,839 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:18:14,066 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:18:14,334 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:18:14,756 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:18:15,055 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:18:15,207 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:18:16,925 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:18:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:23,607 INFO L93 Difference]: Finished difference Result 15860 states and 23187 transitions. [2019-09-08 12:18:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:18:23,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 12:18:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:23,622 INFO L225 Difference]: With dead ends: 15860 [2019-09-08 12:18:23,622 INFO L226 Difference]: Without dead ends: 13957 [2019-09-08 12:18:23,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:18:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-09-08 12:18:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 2898. [2019-09-08 12:18:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-09-08 12:18:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4194 transitions. [2019-09-08 12:18:25,404 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4194 transitions. Word has length 93 [2019-09-08 12:18:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:25,404 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4194 transitions. [2019-09-08 12:18:25,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:18:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4194 transitions. [2019-09-08 12:18:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:18:25,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:25,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:25,405 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 296923704, now seen corresponding path program 1 times [2019-09-08 12:18:25,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:26,153 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-08 12:18:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:18:26,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:18:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:18:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:18:26,156 INFO L87 Difference]: Start difference. First operand 2898 states and 4194 transitions. Second operand 15 states. [2019-09-08 12:18:26,642 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-09-08 12:18:26,858 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:18:27,105 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:18:27,324 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:18:27,529 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 12:18:27,840 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 12:18:27,978 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 12:18:28,178 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:18:28,576 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:18:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:36,704 INFO L93 Difference]: Finished difference Result 14644 states and 21446 transitions. [2019-09-08 12:18:36,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:18:36,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-09-08 12:18:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:36,715 INFO L225 Difference]: With dead ends: 14644 [2019-09-08 12:18:36,716 INFO L226 Difference]: Without dead ends: 12722 [2019-09-08 12:18:36,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:18:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12722 states. [2019-09-08 12:18:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12722 to 2873. [2019-09-08 12:18:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2873 states. [2019-09-08 12:18:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4165 transitions. [2019-09-08 12:18:38,473 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4165 transitions. Word has length 94 [2019-09-08 12:18:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:38,473 INFO L475 AbstractCegarLoop]: Abstraction has 2873 states and 4165 transitions. [2019-09-08 12:18:38,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:18:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4165 transitions. [2019-09-08 12:18:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:18:38,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:38,475 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-08 12:18:38,475 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 48312984, now seen corresponding path program 1 times [2019-09-08 12:18:38,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:38,930 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-08 12:18:38,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:38,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:38,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:38,932 INFO L87 Difference]: Start difference. First operand 2873 states and 4165 transitions. Second operand 10 states. [2019-09-08 12:18:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:45,570 INFO L93 Difference]: Finished difference Result 10839 states and 15854 transitions. [2019-09-08 12:18:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:18:45,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 12:18:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:45,579 INFO L225 Difference]: With dead ends: 10839 [2019-09-08 12:18:45,579 INFO L226 Difference]: Without dead ends: 9676 [2019-09-08 12:18:45,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:18:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9676 states. [2019-09-08 12:18:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9676 to 2480. [2019-09-08 12:18:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-09-08 12:18:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3603 transitions. [2019-09-08 12:18:47,131 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3603 transitions. Word has length 94 [2019-09-08 12:18:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:47,131 INFO L475 AbstractCegarLoop]: Abstraction has 2480 states and 3603 transitions. [2019-09-08 12:18:47,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3603 transitions. [2019-09-08 12:18:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:18:47,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:47,133 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:18:47,133 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1473940751, now seen corresponding path program 1 times [2019-09-08 12:18:47,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:47,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:47,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:47,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:47,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:18:47,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:18:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:18:47,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:18:47,220 INFO L87 Difference]: Start difference. First operand 2480 states and 3603 transitions. Second operand 7 states. [2019-09-08 12:18:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:53,505 INFO L93 Difference]: Finished difference Result 11429 states and 16726 transitions. [2019-09-08 12:18:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:18:53,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:18:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:53,513 INFO L225 Difference]: With dead ends: 11429 [2019-09-08 12:18:53,513 INFO L226 Difference]: Without dead ends: 9038 [2019-09-08 12:18:53,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:18:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9038 states. [2019-09-08 12:18:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9038 to 3867. [2019-09-08 12:18:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3867 states. [2019-09-08 12:18:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 5631 transitions. [2019-09-08 12:18:55,881 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 5631 transitions. Word has length 120 [2019-09-08 12:18:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:55,881 INFO L475 AbstractCegarLoop]: Abstraction has 3867 states and 5631 transitions. [2019-09-08 12:18:55,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:18:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 5631 transitions. [2019-09-08 12:18:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:18:55,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:55,883 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-08 12:18:55,883 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1422172717, now seen corresponding path program 1 times [2019-09-08 12:18:55,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:55,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:18:55,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:18:55,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:18:55,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:18:55,984 INFO L87 Difference]: Start difference. First operand 3867 states and 5631 transitions. Second operand 7 states. [2019-09-08 12:19:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:07,780 INFO L93 Difference]: Finished difference Result 21713 states and 31717 transitions. [2019-09-08 12:19:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:19:07,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:19:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:07,798 INFO L225 Difference]: With dead ends: 21713 [2019-09-08 12:19:07,798 INFO L226 Difference]: Without dead ends: 17953 [2019-09-08 12:19:07,804 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-08 12:19:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-09-08 12:19:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 8235. [2019-09-08 12:19:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8235 states. [2019-09-08 12:19:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8235 states to 8235 states and 11999 transitions. [2019-09-08 12:19:12,702 INFO L78 Accepts]: Start accepts. Automaton has 8235 states and 11999 transitions. Word has length 120 [2019-09-08 12:19:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:12,703 INFO L475 AbstractCegarLoop]: Abstraction has 8235 states and 11999 transitions. [2019-09-08 12:19:12,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:19:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8235 states and 11999 transitions. [2019-09-08 12:19:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:19:12,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:12,705 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-08 12:19:12,705 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1259095623, now seen corresponding path program 1 times [2019-09-08 12:19:12,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:12,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:12,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:12,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:12,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:12,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:19:12,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:19:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:19:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:12,801 INFO L87 Difference]: Start difference. First operand 8235 states and 11999 transitions. Second operand 7 states. [2019-09-08 12:19:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:34,743 INFO L93 Difference]: Finished difference Result 41479 states and 60263 transitions. [2019-09-08 12:19:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:19:34,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:19:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:34,776 INFO L225 Difference]: With dead ends: 41479 [2019-09-08 12:19:34,776 INFO L226 Difference]: Without dead ends: 33351 [2019-09-08 12:19:34,788 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-08 12:19:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33351 states. [2019-09-08 12:19:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33351 to 17581. [2019-09-08 12:19:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17581 states. [2019-09-08 12:19:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17581 states to 17581 states and 25589 transitions. [2019-09-08 12:19:46,153 INFO L78 Accepts]: Start accepts. Automaton has 17581 states and 25589 transitions. Word has length 120 [2019-09-08 12:19:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:46,154 INFO L475 AbstractCegarLoop]: Abstraction has 17581 states and 25589 transitions. [2019-09-08 12:19:46,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:19:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17581 states and 25589 transitions. [2019-09-08 12:19:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:19:46,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:46,155 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-08 12:19:46,156 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:46,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1767863757, now seen corresponding path program 1 times [2019-09-08 12:19:46,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:46,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:46,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:46,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:19:46,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:19:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:19:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:46,248 INFO L87 Difference]: Start difference. First operand 17581 states and 25589 transitions. Second operand 7 states. [2019-09-08 12:20:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:22,386 INFO L93 Difference]: Finished difference Result 76837 states and 111769 transitions. [2019-09-08 12:20:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:20:22,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:20:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:22,449 INFO L225 Difference]: With dead ends: 76837 [2019-09-08 12:20:22,449 INFO L226 Difference]: Without dead ends: 59363 [2019-09-08 12:20:22,474 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-08 12:20:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59363 states. [2019-09-08 12:20:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59363 to 37493. [2019-09-08 12:20:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37493 states. [2019-09-08 12:20:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37493 states to 37493 states and 54477 transitions. [2019-09-08 12:20:44,992 INFO L78 Accepts]: Start accepts. Automaton has 37493 states and 54477 transitions. Word has length 120 [2019-09-08 12:20:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:44,992 INFO L475 AbstractCegarLoop]: Abstraction has 37493 states and 54477 transitions. [2019-09-08 12:20:44,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:20:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37493 states and 54477 transitions. [2019-09-08 12:20:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:20:44,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:44,996 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:20:44,996 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 82630097, now seen corresponding path program 1 times [2019-09-08 12:20:44,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:44,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:44,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:44,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:44,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:45,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:45,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:20:45,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:20:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:20:45,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:20:45,048 INFO L87 Difference]: Start difference. First operand 37493 states and 54477 transitions. Second operand 3 states. [2019-09-08 12:21:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:06,328 INFO L93 Difference]: Finished difference Result 71953 states and 104447 transitions. [2019-09-08 12:21:06,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:21:06,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:21:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:06,369 INFO L225 Difference]: With dead ends: 71953 [2019-09-08 12:21:06,369 INFO L226 Difference]: Without dead ends: 34567 [2019-09-08 12:21:06,392 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-08 12:21:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-09-08 12:21:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 26317. [2019-09-08 12:21:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26317 states. [2019-09-08 12:21:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26317 states to 26317 states and 37715 transitions. [2019-09-08 12:21:23,389 INFO L78 Accepts]: Start accepts. Automaton has 26317 states and 37715 transitions. Word has length 120 [2019-09-08 12:21:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:23,389 INFO L475 AbstractCegarLoop]: Abstraction has 26317 states and 37715 transitions. [2019-09-08 12:21:23,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:21:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26317 states and 37715 transitions. [2019-09-08 12:21:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:21:23,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:23,391 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:21:23,391 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 60321822, now seen corresponding path program 1 times [2019-09-08 12:21:23,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:23,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:23,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:23,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:21:23,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:21:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:21:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:21:23,451 INFO L87 Difference]: Start difference. First operand 26317 states and 37715 transitions. Second operand 3 states. [2019-09-08 12:21:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:55,235 INFO L93 Difference]: Finished difference Result 76175 states and 108887 transitions. [2019-09-08 12:21:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:21:55,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:21:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:55,290 INFO L225 Difference]: With dead ends: 76175 [2019-09-08 12:21:55,290 INFO L226 Difference]: Without dead ends: 49965 [2019-09-08 12:21:55,314 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-08 12:21:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49965 states. [2019-09-08 12:22:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49965 to 36127. [2019-09-08 12:22:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36127 states. [2019-09-08 12:22:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36127 states to 36127 states and 51207 transitions. [2019-09-08 12:22:19,774 INFO L78 Accepts]: Start accepts. Automaton has 36127 states and 51207 transitions. Word has length 121 [2019-09-08 12:22:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:19,775 INFO L475 AbstractCegarLoop]: Abstraction has 36127 states and 51207 transitions. [2019-09-08 12:22:19,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:22:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 36127 states and 51207 transitions. [2019-09-08 12:22:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:22:19,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:19,776 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:19,776 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1186364991, now seen corresponding path program 1 times [2019-09-08 12:22:19,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:22:19,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:22:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:22:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:22:19,836 INFO L87 Difference]: Start difference. First operand 36127 states and 51207 transitions. Second operand 3 states. [2019-09-08 12:22:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:49,032 INFO L93 Difference]: Finished difference Result 79430 states and 112602 transitions. [2019-09-08 12:22:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:22:49,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:22:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:49,078 INFO L225 Difference]: With dead ends: 79430 [2019-09-08 12:22:49,078 INFO L226 Difference]: Without dead ends: 43407 [2019-09-08 12:22:49,105 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-08 12:22:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43407 states. [2019-09-08 12:23:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43407 to 35683. [2019-09-08 12:23:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35683 states. [2019-09-08 12:23:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35683 states to 35683 states and 50078 transitions. [2019-09-08 12:23:14,264 INFO L78 Accepts]: Start accepts. Automaton has 35683 states and 50078 transitions. Word has length 122 [2019-09-08 12:23:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:14,264 INFO L475 AbstractCegarLoop]: Abstraction has 35683 states and 50078 transitions. [2019-09-08 12:23:14,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 35683 states and 50078 transitions. [2019-09-08 12:23:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:23:14,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:14,266 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:14,266 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash -970525357, now seen corresponding path program 1 times [2019-09-08 12:23:14,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:14,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:14,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:14,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:23:14,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:23:14,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:23:14,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:14,324 INFO L87 Difference]: Start difference. First operand 35683 states and 50078 transitions. Second operand 3 states. [2019-09-08 12:23:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:42,255 INFO L93 Difference]: Finished difference Result 69951 states and 98323 transitions. [2019-09-08 12:23:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:23:42,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:23:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:42,293 INFO L225 Difference]: With dead ends: 69951 [2019-09-08 12:23:42,293 INFO L226 Difference]: Without dead ends: 40350 [2019-09-08 12:23:42,310 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-08 12:23:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40350 states. [2019-09-08 12:24:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40350 to 39576. [2019-09-08 12:24:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39576 states. [2019-09-08 12:24:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39576 states to 39576 states and 55235 transitions. [2019-09-08 12:24:08,947 INFO L78 Accepts]: Start accepts. Automaton has 39576 states and 55235 transitions. Word has length 123 [2019-09-08 12:24:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:08,948 INFO L475 AbstractCegarLoop]: Abstraction has 39576 states and 55235 transitions. [2019-09-08 12:24:08,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 39576 states and 55235 transitions. [2019-09-08 12:24:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:08,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:08,954 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 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-08 12:24:08,954 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 966565970, now seen corresponding path program 1 times [2019-09-08 12:24:08,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:24:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:09,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:09,016 INFO L87 Difference]: Start difference. First operand 39576 states and 55235 transitions. Second operand 3 states. [2019-09-08 12:24:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:43,454 INFO L93 Difference]: Finished difference Result 87824 states and 122321 transitions. [2019-09-08 12:24:43,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:43,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:24:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:43,502 INFO L225 Difference]: With dead ends: 87824 [2019-09-08 12:24:43,502 INFO L226 Difference]: Without dead ends: 48345 [2019-09-08 12:24:43,529 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-08 12:24:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48345 states. [2019-09-08 12:25:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48345 to 45903. [2019-09-08 12:25:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45903 states. [2019-09-08 12:25:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45903 states to 45903 states and 63527 transitions. [2019-09-08 12:25:14,944 INFO L78 Accepts]: Start accepts. Automaton has 45903 states and 63527 transitions. Word has length 150 [2019-09-08 12:25:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:14,944 INFO L475 AbstractCegarLoop]: Abstraction has 45903 states and 63527 transitions. [2019-09-08 12:25:14,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45903 states and 63527 transitions. [2019-09-08 12:25:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:25:14,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:14,949 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:25:14,949 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:14,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash 241471334, now seen corresponding path program 1 times [2019-09-08 12:25:14,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:15,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:25:15,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:25:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:15,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:25:15,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:25:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:15,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:25:15,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 12:25:15,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:25:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:25:15,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:25:15,532 INFO L87 Difference]: Start difference. First operand 45903 states and 63527 transitions. Second operand 13 states. [2019-09-08 12:27:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:28,690 INFO L93 Difference]: Finished difference Result 216123 states and 295612 transitions. [2019-09-08 12:27:28,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 12:27:28,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 151 [2019-09-08 12:27:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:29,332 INFO L225 Difference]: With dead ends: 216123 [2019-09-08 12:27:29,332 INFO L226 Difference]: Without dead ends: 170317 [2019-09-08 12:27:29,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1067, Invalid=3223, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 12:27:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170317 states.