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-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:13:02,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:13:02,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:13:02,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:13:02,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:13:02,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:13:02,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:13:02,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:13:02,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:13:02,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:13:02,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:13:02,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:13:02,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:13:02,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:13:02,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:13:02,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:13:02,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:13:02,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:13:02,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:13:02,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:13:02,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:13:02,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:13:02,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:13:02,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:13:02,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:13:02,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:13:02,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:13:02,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:13:02,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:13:02,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:13:02,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:13:02,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:13:02,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:13:02,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:13:02,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:13:02,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:13:02,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:13:02,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:13:02,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:13:02,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:13:02,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:13:02,719 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 11:13:02,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:13:02,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:13:02,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:13:02,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:13:02,736 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:13:02,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:13:02,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:13:02,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:13:02,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:13:02,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:13:02,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:13:02,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:13:02,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:13:02,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:13:02,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:13:02,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:13:02,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:13:02,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:13:02,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:13:02,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:13:02,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:13:02,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:13:02,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:13:02,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:13:02,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:13:02,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:13:02,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:13:02,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:13:02,789 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:13:02,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:13:02,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5acd8ac9/fe2517c3eda84dc59b86eb1b83ae8357/FLAGa7502cf4f [2019-09-08 11:13:03,438 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:13:03,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:13:03,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5acd8ac9/fe2517c3eda84dc59b86eb1b83ae8357/FLAGa7502cf4f [2019-09-08 11:13:03,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5acd8ac9/fe2517c3eda84dc59b86eb1b83ae8357 [2019-09-08 11:13:03,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:13:03,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:13:03,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:03,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:13:03,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:13:03,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:03" (1/1) ... [2019-09-08 11:13:03,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fabe5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:03, skipping insertion in model container [2019-09-08 11:13:03,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:03" (1/1) ... [2019-09-08 11:13:03,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:13:03,827 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:13:04,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:04,397 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:13:04,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:04,561 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:13:04,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04 WrapperNode [2019-09-08 11:13:04,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:04,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:13:04,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:13:04,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:13:04,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (1/1) ... [2019-09-08 11:13:04,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:13:04,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:13:04,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:13:04,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:13:04,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (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 11:13:04,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:13:04,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:13:04,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:13:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:13:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:13:04,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:13:04,752 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:13:04,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:13:04,752 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:13:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:13:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:13:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:13:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:13:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:13:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:13:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:13:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:13:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:13:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:13:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:13:06,079 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:13:06,079 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:13:06,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:06 BoogieIcfgContainer [2019-09-08 11:13:06,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:13:06,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:13:06,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:13:06,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:13:06,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:13:03" (1/3) ... [2019-09-08 11:13:06,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d00f9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:06, skipping insertion in model container [2019-09-08 11:13:06,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:04" (2/3) ... [2019-09-08 11:13:06,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d00f9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:06, skipping insertion in model container [2019-09-08 11:13:06,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:06" (3/3) ... [2019-09-08 11:13:06,098 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:13:06,111 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:13:06,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:13:06,153 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:13:06,204 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:13:06,206 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:13:06,206 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:13:06,206 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:13:06,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:13:06,207 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:13:06,207 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:13:06,207 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:13:06,207 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:13:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-08 11:13:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:13:06,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:06,283 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 11:13:06,286 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash -911000536, now seen corresponding path program 1 times [2019-09-08 11:13:06,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:06,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:06,699 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 11:13:06,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:13:06,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:13:06,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:13:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:13:06,727 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 4 states. [2019-09-08 11:13:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:06,950 INFO L93 Difference]: Finished difference Result 636 states and 1028 transitions. [2019-09-08 11:13:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:06,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-08 11:13:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:06,968 INFO L225 Difference]: With dead ends: 636 [2019-09-08 11:13:06,969 INFO L226 Difference]: Without dead ends: 331 [2019-09-08 11:13:06,975 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 11:13:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-08 11:13:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-09-08 11:13:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-08 11:13:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 505 transitions. [2019-09-08 11:13:07,068 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 505 transitions. Word has length 83 [2019-09-08 11:13:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:07,068 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 505 transitions. [2019-09-08 11:13:07,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:13:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 505 transitions. [2019-09-08 11:13:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 11:13:07,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:07,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:07,074 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1025067494, now seen corresponding path program 1 times [2019-09-08 11:13:07,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:07,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:07,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:07,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:07,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:07,317 INFO L87 Difference]: Start difference. First operand 331 states and 505 transitions. Second operand 3 states. [2019-09-08 11:13:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:07,375 INFO L93 Difference]: Finished difference Result 765 states and 1197 transitions. [2019-09-08 11:13:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:07,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-08 11:13:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:07,381 INFO L225 Difference]: With dead ends: 765 [2019-09-08 11:13:07,381 INFO L226 Difference]: Without dead ends: 487 [2019-09-08 11:13:07,383 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 11:13:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-08 11:13:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-09-08 11:13:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-08 11:13:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 749 transitions. [2019-09-08 11:13:07,443 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 749 transitions. Word has length 114 [2019-09-08 11:13:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:07,444 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 749 transitions. [2019-09-08 11:13:07,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 749 transitions. [2019-09-08 11:13:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:13:07,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:07,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:07,449 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1815110171, now seen corresponding path program 1 times [2019-09-08 11:13:07,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:07,610 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 11:13:07,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:07,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:07,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:07,612 INFO L87 Difference]: Start difference. First operand 485 states and 749 transitions. Second operand 3 states. [2019-09-08 11:13:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:07,664 INFO L93 Difference]: Finished difference Result 1167 states and 1836 transitions. [2019-09-08 11:13:07,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:07,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:13:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:07,669 INFO L225 Difference]: With dead ends: 1167 [2019-09-08 11:13:07,670 INFO L226 Difference]: Without dead ends: 748 [2019-09-08 11:13:07,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-08 11:13:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-08 11:13:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 11:13:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1162 transitions. [2019-09-08 11:13:07,705 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1162 transitions. Word has length 116 [2019-09-08 11:13:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:07,706 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1162 transitions. [2019-09-08 11:13:07,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1162 transitions. [2019-09-08 11:13:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 11:13:07,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:07,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:07,710 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash -276878061, now seen corresponding path program 1 times [2019-09-08 11:13:07,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:07,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:07,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:07,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:07,816 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 11:13:07,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:07,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:07,817 INFO L87 Difference]: Start difference. First operand 746 states and 1162 transitions. Second operand 3 states. [2019-09-08 11:13:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:07,886 INFO L93 Difference]: Finished difference Result 1838 states and 2898 transitions. [2019-09-08 11:13:07,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:07,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 11:13:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:07,894 INFO L225 Difference]: With dead ends: 1838 [2019-09-08 11:13:07,894 INFO L226 Difference]: Without dead ends: 1171 [2019-09-08 11:13:07,897 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 11:13:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-08 11:13:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2019-09-08 11:13:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2019-09-08 11:13:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1828 transitions. [2019-09-08 11:13:07,947 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1828 transitions. Word has length 118 [2019-09-08 11:13:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:07,948 INFO L475 AbstractCegarLoop]: Abstraction has 1169 states and 1828 transitions. [2019-09-08 11:13:07,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1828 transitions. [2019-09-08 11:13:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 11:13:07,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:07,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:07,952 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2034189920, now seen corresponding path program 1 times [2019-09-08 11:13:07,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:07,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:08,055 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 11:13:08,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:08,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:08,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:08,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:08,057 INFO L87 Difference]: Start difference. First operand 1169 states and 1828 transitions. Second operand 3 states. [2019-09-08 11:13:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:08,149 INFO L93 Difference]: Finished difference Result 2891 states and 4551 transitions. [2019-09-08 11:13:08,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:08,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 11:13:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:08,159 INFO L225 Difference]: With dead ends: 2891 [2019-09-08 11:13:08,160 INFO L226 Difference]: Without dead ends: 1814 [2019-09-08 11:13:08,163 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 11:13:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-08 11:13:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1812. [2019-09-08 11:13:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1812 states. [2019-09-08 11:13:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2830 transitions. [2019-09-08 11:13:08,239 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2830 transitions. Word has length 120 [2019-09-08 11:13:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:08,240 INFO L475 AbstractCegarLoop]: Abstraction has 1812 states and 2830 transitions. [2019-09-08 11:13:08,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2830 transitions. [2019-09-08 11:13:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 11:13:08,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:08,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:08,246 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:08,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:08,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1700990007, now seen corresponding path program 1 times [2019-09-08 11:13:08,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:08,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:08,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:08,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:08,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:08,329 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 11:13:08,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:08,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:08,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:08,331 INFO L87 Difference]: Start difference. First operand 1812 states and 2830 transitions. Second operand 3 states. [2019-09-08 11:13:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:08,458 INFO L93 Difference]: Finished difference Result 4396 states and 6876 transitions. [2019-09-08 11:13:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:08,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 11:13:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:08,472 INFO L225 Difference]: With dead ends: 4396 [2019-09-08 11:13:08,473 INFO L226 Difference]: Without dead ends: 2689 [2019-09-08 11:13:08,477 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 11:13:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2019-09-08 11:13:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2687. [2019-09-08 11:13:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-09-08 11:13:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4164 transitions. [2019-09-08 11:13:08,630 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4164 transitions. Word has length 122 [2019-09-08 11:13:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:08,630 INFO L475 AbstractCegarLoop]: Abstraction has 2687 states and 4164 transitions. [2019-09-08 11:13:08,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4164 transitions. [2019-09-08 11:13:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 11:13:08,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:08,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:08,639 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2140897977, now seen corresponding path program 1 times [2019-09-08 11:13:08,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:08,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:08,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:09,019 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 11:13:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:09,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:09,021 INFO L87 Difference]: Start difference. First operand 2687 states and 4164 transitions. Second operand 7 states. [2019-09-08 11:13:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:10,302 INFO L93 Difference]: Finished difference Result 13889 states and 21472 transitions. [2019-09-08 11:13:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:10,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 11:13:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:10,361 INFO L225 Difference]: With dead ends: 13889 [2019-09-08 11:13:10,362 INFO L226 Difference]: Without dead ends: 11301 [2019-09-08 11:13:10,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2019-09-08 11:13:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11293. [2019-09-08 11:13:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11293 states. [2019-09-08 11:13:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 17129 transitions. [2019-09-08 11:13:11,218 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 17129 transitions. Word has length 124 [2019-09-08 11:13:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:11,219 INFO L475 AbstractCegarLoop]: Abstraction has 11293 states and 17129 transitions. [2019-09-08 11:13:11,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 17129 transitions. [2019-09-08 11:13:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:13:11,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:11,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:11,331 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:11,332 INFO L82 PathProgramCache]: Analyzing trace with hash 65222622, now seen corresponding path program 1 times [2019-09-08 11:13:11,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:11,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:11,416 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 11:13:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:11,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:11,418 INFO L87 Difference]: Start difference. First operand 11293 states and 17129 transitions. Second operand 3 states. [2019-09-08 11:13:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:12,274 INFO L93 Difference]: Finished difference Result 28589 states and 43301 transitions. [2019-09-08 11:13:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:12,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:13:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:12,348 INFO L225 Difference]: With dead ends: 28589 [2019-09-08 11:13:12,349 INFO L226 Difference]: Without dead ends: 19700 [2019-09-08 11:13:12,372 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 11:13:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19700 states. [2019-09-08 11:13:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19700 to 19698. [2019-09-08 11:13:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19698 states. [2019-09-08 11:13:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19698 states to 19698 states and 29631 transitions. [2019-09-08 11:13:13,434 INFO L78 Accepts]: Start accepts. Automaton has 19698 states and 29631 transitions. Word has length 126 [2019-09-08 11:13:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:13,434 INFO L475 AbstractCegarLoop]: Abstraction has 19698 states and 29631 transitions. [2019-09-08 11:13:13,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19698 states and 29631 transitions. [2019-09-08 11:13:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:13:13,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:13,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:13,484 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1951025456, now seen corresponding path program 1 times [2019-09-08 11:13:13,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:14,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:14,189 INFO L87 Difference]: Start difference. First operand 19698 states and 29631 transitions. Second operand 3 states. [2019-09-08 11:13:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:14,974 INFO L93 Difference]: Finished difference Result 34196 states and 51344 transitions. [2019-09-08 11:13:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:14,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:13:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:15,026 INFO L225 Difference]: With dead ends: 34196 [2019-09-08 11:13:15,026 INFO L226 Difference]: Without dead ends: 21894 [2019-09-08 11:13:15,050 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 11:13:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2019-09-08 11:13:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 21892. [2019-09-08 11:13:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21892 states. [2019-09-08 11:13:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21892 states to 21892 states and 32934 transitions. [2019-09-08 11:13:16,026 INFO L78 Accepts]: Start accepts. Automaton has 21892 states and 32934 transitions. Word has length 126 [2019-09-08 11:13:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:16,026 INFO L475 AbstractCegarLoop]: Abstraction has 21892 states and 32934 transitions. [2019-09-08 11:13:16,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21892 states and 32934 transitions. [2019-09-08 11:13:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:13:16,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:16,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:16,076 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash 7426086, now seen corresponding path program 1 times [2019-09-08 11:13:16,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:16,166 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 11:13:16,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:16,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:16,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:16,168 INFO L87 Difference]: Start difference. First operand 21892 states and 32934 transitions. Second operand 3 states. [2019-09-08 11:13:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:17,196 INFO L93 Difference]: Finished difference Result 50118 states and 75318 transitions. [2019-09-08 11:13:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:17,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:13:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:17,272 INFO L225 Difference]: With dead ends: 50118 [2019-09-08 11:13:17,272 INFO L226 Difference]: Without dead ends: 34200 [2019-09-08 11:13:17,308 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 11:13:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34200 states. [2019-09-08 11:13:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34200 to 34198. [2019-09-08 11:13:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34198 states. [2019-09-08 11:13:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34198 states to 34198 states and 51260 transitions. [2019-09-08 11:13:18,644 INFO L78 Accepts]: Start accepts. Automaton has 34198 states and 51260 transitions. Word has length 126 [2019-09-08 11:13:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:18,644 INFO L475 AbstractCegarLoop]: Abstraction has 34198 states and 51260 transitions. [2019-09-08 11:13:18,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34198 states and 51260 transitions. [2019-09-08 11:13:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:13:18,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:18,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:18,712 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1965979855, now seen corresponding path program 1 times [2019-09-08 11:13:18,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:18,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:18,790 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 11:13:18,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:18,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:18,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:18,792 INFO L87 Difference]: Start difference. First operand 34198 states and 51260 transitions. Second operand 3 states. [2019-09-08 11:13:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:20,245 INFO L93 Difference]: Finished difference Result 70431 states and 105409 transitions. [2019-09-08 11:13:20,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:20,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:13:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:20,349 INFO L225 Difference]: With dead ends: 70431 [2019-09-08 11:13:20,350 INFO L226 Difference]: Without dead ends: 46909 [2019-09-08 11:13:20,399 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 11:13:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2019-09-08 11:13:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 46907. [2019-09-08 11:13:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46907 states. [2019-09-08 11:13:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46907 states to 46907 states and 70039 transitions. [2019-09-08 11:13:22,879 INFO L78 Accepts]: Start accepts. Automaton has 46907 states and 70039 transitions. Word has length 126 [2019-09-08 11:13:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:22,879 INFO L475 AbstractCegarLoop]: Abstraction has 46907 states and 70039 transitions. [2019-09-08 11:13:22,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46907 states and 70039 transitions. [2019-09-08 11:13:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:13:22,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:22,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:22,941 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1195527623, now seen corresponding path program 1 times [2019-09-08 11:13:22,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:22,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:23,039 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 11:13:23,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:23,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:23,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:23,041 INFO L87 Difference]: Start difference. First operand 46907 states and 70039 transitions. Second operand 5 states. [2019-09-08 11:13:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:26,066 INFO L93 Difference]: Finished difference Result 119748 states and 178305 transitions. [2019-09-08 11:13:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:26,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-08 11:13:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:26,189 INFO L225 Difference]: With dead ends: 119748 [2019-09-08 11:13:26,189 INFO L226 Difference]: Without dead ends: 72889 [2019-09-08 11:13:26,258 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 11:13:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72889 states. [2019-09-08 11:13:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72889 to 72887. [2019-09-08 11:13:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72887 states. [2019-09-08 11:13:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72887 states to 72887 states and 107936 transitions. [2019-09-08 11:13:30,207 INFO L78 Accepts]: Start accepts. Automaton has 72887 states and 107936 transitions. Word has length 128 [2019-09-08 11:13:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:30,207 INFO L475 AbstractCegarLoop]: Abstraction has 72887 states and 107936 transitions. [2019-09-08 11:13:30,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 72887 states and 107936 transitions. [2019-09-08 11:13:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:13:30,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:30,278 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:30,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash -217394905, now seen corresponding path program 1 times [2019-09-08 11:13:30,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:30,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:30,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:30,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:30,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:30,369 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 11:13:30,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:30,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:30,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:30,371 INFO L87 Difference]: Start difference. First operand 72887 states and 107936 transitions. Second operand 3 states. [2019-09-08 11:13:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:33,002 INFO L93 Difference]: Finished difference Result 128227 states and 188906 transitions. [2019-09-08 11:13:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:33,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 11:13:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:33,095 INFO L225 Difference]: With dead ends: 128227 [2019-09-08 11:13:33,095 INFO L226 Difference]: Without dead ends: 65509 [2019-09-08 11:13:33,161 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 11:13:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65509 states. [2019-09-08 11:13:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65509 to 65507. [2019-09-08 11:13:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65507 states. [2019-09-08 11:13:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65507 states to 65507 states and 95772 transitions. [2019-09-08 11:13:37,036 INFO L78 Accepts]: Start accepts. Automaton has 65507 states and 95772 transitions. Word has length 128 [2019-09-08 11:13:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:37,036 INFO L475 AbstractCegarLoop]: Abstraction has 65507 states and 95772 transitions. [2019-09-08 11:13:37,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 65507 states and 95772 transitions. [2019-09-08 11:13:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:13:37,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:37,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:37,072 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1115908038, now seen corresponding path program 1 times [2019-09-08 11:13:37,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:37,159 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 11:13:37,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:37,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:37,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:37,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:37,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:37,161 INFO L87 Difference]: Start difference. First operand 65507 states and 95772 transitions. Second operand 3 states. [2019-09-08 11:13:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:38,656 INFO L93 Difference]: Finished difference Result 93155 states and 135922 transitions. [2019-09-08 11:13:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:38,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 11:13:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:38,695 INFO L225 Difference]: With dead ends: 93155 [2019-09-08 11:13:38,695 INFO L226 Difference]: Without dead ends: 33559 [2019-09-08 11:13:38,739 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 11:13:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33559 states. [2019-09-08 11:13:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33559 to 33557. [2019-09-08 11:13:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33557 states. [2019-09-08 11:13:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33557 states to 33557 states and 48688 transitions. [2019-09-08 11:13:41,501 INFO L78 Accepts]: Start accepts. Automaton has 33557 states and 48688 transitions. Word has length 128 [2019-09-08 11:13:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:41,501 INFO L475 AbstractCegarLoop]: Abstraction has 33557 states and 48688 transitions. [2019-09-08 11:13:41,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 33557 states and 48688 transitions. [2019-09-08 11:13:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:13:41,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:41,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:41,520 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1673717793, now seen corresponding path program 1 times [2019-09-08 11:13:41,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:41,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:41,600 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 11:13:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:41,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:41,602 INFO L87 Difference]: Start difference. First operand 33557 states and 48688 transitions. Second operand 3 states. [2019-09-08 11:13:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:42,227 INFO L93 Difference]: Finished difference Result 47389 states and 68604 transitions. [2019-09-08 11:13:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:42,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 11:13:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:42,249 INFO L225 Difference]: With dead ends: 47389 [2019-09-08 11:13:42,250 INFO L226 Difference]: Without dead ends: 17443 [2019-09-08 11:13:42,274 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 11:13:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17443 states. [2019-09-08 11:13:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17443 to 17441. [2019-09-08 11:13:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17441 states. [2019-09-08 11:13:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 25144 transitions. [2019-09-08 11:13:42,809 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 25144 transitions. Word has length 128 [2019-09-08 11:13:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:42,809 INFO L475 AbstractCegarLoop]: Abstraction has 17441 states and 25144 transitions. [2019-09-08 11:13:42,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 25144 transitions. [2019-09-08 11:13:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:13:42,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:42,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:42,819 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1368528636, now seen corresponding path program 1 times [2019-09-08 11:13:42,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:42,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:42,979 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 11:13:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:42,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:42,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:42,981 INFO L87 Difference]: Start difference. First operand 17441 states and 25144 transitions. Second operand 7 states. [2019-09-08 11:13:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:45,802 INFO L93 Difference]: Finished difference Result 78434 states and 112879 transitions. [2019-09-08 11:13:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:45,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 11:13:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:45,878 INFO L225 Difference]: With dead ends: 78434 [2019-09-08 11:13:45,879 INFO L226 Difference]: Without dead ends: 61515 [2019-09-08 11:13:45,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:13:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61515 states. [2019-09-08 11:13:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61515 to 33706. [2019-09-08 11:13:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33706 states. [2019-09-08 11:13:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33706 states to 33706 states and 47695 transitions. [2019-09-08 11:13:47,820 INFO L78 Accepts]: Start accepts. Automaton has 33706 states and 47695 transitions. Word has length 128 [2019-09-08 11:13:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:47,820 INFO L475 AbstractCegarLoop]: Abstraction has 33706 states and 47695 transitions. [2019-09-08 11:13:47,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33706 states and 47695 transitions. [2019-09-08 11:13:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:13:47,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:47,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:47,840 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 908994833, now seen corresponding path program 1 times [2019-09-08 11:13:47,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:47,973 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 11:13:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:13:47,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:13:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:13:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:13:47,975 INFO L87 Difference]: Start difference. First operand 33706 states and 47695 transitions. Second operand 6 states. [2019-09-08 11:13:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:51,103 INFO L93 Difference]: Finished difference Result 62596 states and 87844 transitions. [2019-09-08 11:13:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:51,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-08 11:13:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:51,171 INFO L225 Difference]: With dead ends: 62596 [2019-09-08 11:13:51,171 INFO L226 Difference]: Without dead ends: 62594 [2019-09-08 11:13:51,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:13:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62594 states. [2019-09-08 11:13:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62594 to 34938. [2019-09-08 11:13:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34938 states. [2019-09-08 11:13:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34938 states to 34938 states and 48927 transitions. [2019-09-08 11:13:53,473 INFO L78 Accepts]: Start accepts. Automaton has 34938 states and 48927 transitions. Word has length 131 [2019-09-08 11:13:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:53,474 INFO L475 AbstractCegarLoop]: Abstraction has 34938 states and 48927 transitions. [2019-09-08 11:13:53,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:13:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34938 states and 48927 transitions. [2019-09-08 11:13:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:13:53,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:53,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:53,494 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1876311282, now seen corresponding path program 1 times [2019-09-08 11:13:53,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:53,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:53,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:53,561 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 11:13:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:53,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:53,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:53,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:53,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:53,563 INFO L87 Difference]: Start difference. First operand 34938 states and 48927 transitions. Second operand 3 states. [2019-09-08 11:13:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:56,567 INFO L93 Difference]: Finished difference Result 85600 states and 118738 transitions. [2019-09-08 11:13:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:56,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 11:13:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:56,632 INFO L225 Difference]: With dead ends: 85600 [2019-09-08 11:13:56,633 INFO L226 Difference]: Without dead ends: 51167 [2019-09-08 11:13:56,664 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 11:13:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51167 states. [2019-09-08 11:13:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51167 to 49685. [2019-09-08 11:13:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49685 states. [2019-09-08 11:13:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49685 states to 49685 states and 68571 transitions. [2019-09-08 11:13:59,693 INFO L78 Accepts]: Start accepts. Automaton has 49685 states and 68571 transitions. Word has length 132 [2019-09-08 11:13:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:59,693 INFO L475 AbstractCegarLoop]: Abstraction has 49685 states and 68571 transitions. [2019-09-08 11:13:59,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 49685 states and 68571 transitions. [2019-09-08 11:13:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:13:59,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:59,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:13:59,726 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 844346502, now seen corresponding path program 1 times [2019-09-08 11:13:59,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:59,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:59,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:59,791 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 11:13:59,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:59,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:59,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:59,793 INFO L87 Difference]: Start difference. First operand 49685 states and 68571 transitions. Second operand 3 states. [2019-09-08 11:14:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:04,744 INFO L93 Difference]: Finished difference Result 123197 states and 168442 transitions. [2019-09-08 11:14:04,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:04,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 11:14:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:04,840 INFO L225 Difference]: With dead ends: 123197 [2019-09-08 11:14:04,840 INFO L226 Difference]: Without dead ends: 82137 [2019-09-08 11:14:04,880 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 11:14:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82137 states. [2019-09-08 11:14:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82137 to 81767. [2019-09-08 11:14:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81767 states. [2019-09-08 11:14:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81767 states to 81767 states and 110607 transitions. [2019-09-08 11:14:10,330 INFO L78 Accepts]: Start accepts. Automaton has 81767 states and 110607 transitions. Word has length 132 [2019-09-08 11:14:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:10,331 INFO L475 AbstractCegarLoop]: Abstraction has 81767 states and 110607 transitions. [2019-09-08 11:14:10,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 81767 states and 110607 transitions. [2019-09-08 11:14:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:14:10,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:10,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:10,387 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1658001551, now seen corresponding path program 1 times [2019-09-08 11:14:10,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:10,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:10,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:10,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:10,511 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 11:14:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:14:10,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:14:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:14:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:14:10,512 INFO L87 Difference]: Start difference. First operand 81767 states and 110607 transitions. Second operand 7 states. [2019-09-08 11:14:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:25,297 INFO L93 Difference]: Finished difference Result 209641 states and 281520 transitions. [2019-09-08 11:14:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:25,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-08 11:14:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:25,519 INFO L225 Difference]: With dead ends: 209641 [2019-09-08 11:14:25,519 INFO L226 Difference]: Without dead ends: 195611 [2019-09-08 11:14:25,557 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 11:14:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195611 states. [2019-09-08 11:14:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195611 to 81939. [2019-09-08 11:14:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81939 states. [2019-09-08 11:14:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81939 states to 81939 states and 110801 transitions. [2019-09-08 11:14:32,525 INFO L78 Accepts]: Start accepts. Automaton has 81939 states and 110801 transitions. Word has length 132 [2019-09-08 11:14:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:32,526 INFO L475 AbstractCegarLoop]: Abstraction has 81939 states and 110801 transitions. [2019-09-08 11:14:32,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:14:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 81939 states and 110801 transitions. [2019-09-08 11:14:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:14:32,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:32,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:32,583 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1351755653, now seen corresponding path program 1 times [2019-09-08 11:14:32,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:32,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:32,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:32,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:32,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:32,651 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 11:14:32,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:32,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:32,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:32,653 INFO L87 Difference]: Start difference. First operand 81939 states and 110801 transitions. Second operand 3 states. [2019-09-08 11:14:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:47,082 INFO L93 Difference]: Finished difference Result 236787 states and 319798 transitions. [2019-09-08 11:14:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:47,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 11:14:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:47,292 INFO L225 Difference]: With dead ends: 236787 [2019-09-08 11:14:47,292 INFO L226 Difference]: Without dead ends: 161984 [2019-09-08 11:14:47,356 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 11:14:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161984 states. [2019-09-08 11:15:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161984 to 161535. [2019-09-08 11:15:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161535 states. [2019-09-08 11:15:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161535 states to 161535 states and 217309 transitions. [2019-09-08 11:15:01,401 INFO L78 Accepts]: Start accepts. Automaton has 161535 states and 217309 transitions. Word has length 132 [2019-09-08 11:15:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:01,402 INFO L475 AbstractCegarLoop]: Abstraction has 161535 states and 217309 transitions. [2019-09-08 11:15:01,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 161535 states and 217309 transitions. [2019-09-08 11:15:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:15:01,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:01,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:01,544 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849120, now seen corresponding path program 1 times [2019-09-08 11:15:01,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:01,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:01,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:01,631 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 11:15:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:15:01,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:15:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:15:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:15:01,632 INFO L87 Difference]: Start difference. First operand 161535 states and 217309 transitions. Second operand 6 states. [2019-09-08 11:15:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:22,259 INFO L93 Difference]: Finished difference Result 400389 states and 537672 transitions. [2019-09-08 11:15:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:22,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-08 11:15:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:22,562 INFO L225 Difference]: With dead ends: 400389 [2019-09-08 11:15:22,563 INFO L226 Difference]: Without dead ends: 244921 [2019-09-08 11:15:22,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:15:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244921 states. [2019-09-08 11:15:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244921 to 236176. [2019-09-08 11:15:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236176 states. [2019-09-08 11:15:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236176 states to 236176 states and 316382 transitions. [2019-09-08 11:15:44,180 INFO L78 Accepts]: Start accepts. Automaton has 236176 states and 316382 transitions. Word has length 132 [2019-09-08 11:15:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:44,181 INFO L475 AbstractCegarLoop]: Abstraction has 236176 states and 316382 transitions. [2019-09-08 11:15:44,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:15:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 236176 states and 316382 transitions. [2019-09-08 11:15:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:15:44,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:44,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:44,284 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1824231082, now seen corresponding path program 1 times [2019-09-08 11:15:44,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:44,383 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 11:15:44,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:44,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:44,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:44,385 INFO L87 Difference]: Start difference. First operand 236176 states and 316382 transitions. Second operand 7 states. [2019-09-08 11:16:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:29,611 INFO L93 Difference]: Finished difference Result 647277 states and 868069 transitions. [2019-09-08 11:16:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:16:29,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-08 11:16:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:30,397 INFO L225 Difference]: With dead ends: 647277 [2019-09-08 11:16:30,397 INFO L226 Difference]: Without dead ends: 558675 [2019-09-08 11:16:30,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:16:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558675 states. [2019-09-08 11:16:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558675 to 236643. [2019-09-08 11:16:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236643 states. [2019-09-08 11:17:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236643 states to 236643 states and 316997 transitions. [2019-09-08 11:17:03,261 INFO L78 Accepts]: Start accepts. Automaton has 236643 states and 316997 transitions. Word has length 132 [2019-09-08 11:17:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:03,261 INFO L475 AbstractCegarLoop]: Abstraction has 236643 states and 316997 transitions. [2019-09-08 11:17:03,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:17:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 236643 states and 316997 transitions. [2019-09-08 11:17:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:17:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:03,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:03,367 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 783261860, now seen corresponding path program 1 times [2019-09-08 11:17:03,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:03,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:03,446 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 11:17:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:03,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:03,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:03,447 INFO L87 Difference]: Start difference. First operand 236643 states and 316997 transitions. Second operand 5 states. [2019-09-08 11:17:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:44,989 INFO L93 Difference]: Finished difference Result 672939 states and 901483 transitions. [2019-09-08 11:17:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:44,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 11:17:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:46,019 INFO L225 Difference]: With dead ends: 672939 [2019-09-08 11:17:46,019 INFO L226 Difference]: Without dead ends: 436537 [2019-09-08 11:17:46,208 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 11:17:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436537 states. [2019-09-08 11:18:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436537 to 436128. [2019-09-08 11:18:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436128 states. [2019-09-08 11:18:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436128 states to 436128 states and 580969 transitions. [2019-09-08 11:18:31,716 INFO L78 Accepts]: Start accepts. Automaton has 436128 states and 580969 transitions. Word has length 132 [2019-09-08 11:18:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:31,716 INFO L475 AbstractCegarLoop]: Abstraction has 436128 states and 580969 transitions. [2019-09-08 11:18:31,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:18:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 436128 states and 580969 transitions. [2019-09-08 11:18:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:18:31,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:31,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:31,872 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1304932114, now seen corresponding path program 1 times [2019-09-08 11:18:31,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:31,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:31,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:31,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 11:18:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:18:31,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:18:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:18:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:18:31,987 INFO L87 Difference]: Start difference. First operand 436128 states and 580969 transitions. Second operand 7 states. [2019-09-08 11:20:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:16,430 INFO L93 Difference]: Finished difference Result 1136524 states and 1509454 transitions. [2019-09-08 11:20:16,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:20:16,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-08 11:20:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:18,742 INFO L225 Difference]: With dead ends: 1136524 [2019-09-08 11:20:18,742 INFO L226 Difference]: Without dead ends: 1045300 [2019-09-08 11:20:18,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:20:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045300 states. [2019-09-08 11:21:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045300 to 439037. [2019-09-08 11:21:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439037 states. [2019-09-08 11:21:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439037 states to 439037 states and 584852 transitions. [2019-09-08 11:21:16,736 INFO L78 Accepts]: Start accepts. Automaton has 439037 states and 584852 transitions. Word has length 132 [2019-09-08 11:21:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:16,736 INFO L475 AbstractCegarLoop]: Abstraction has 439037 states and 584852 transitions. [2019-09-08 11:21:16,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:21:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 439037 states and 584852 transitions. [2019-09-08 11:21:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:21:16,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:16,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:16,933 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash -619029604, now seen corresponding path program 1 times [2019-09-08 11:21:16,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:16,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:17,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:17,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:17,019 INFO L87 Difference]: Start difference. First operand 439037 states and 584852 transitions. Second operand 3 states. [2019-09-08 11:22:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:51,609 INFO L93 Difference]: Finished difference Result 1292152 states and 1717158 transitions. [2019-09-08 11:22:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:22:51,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 11:22:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:53,865 INFO L225 Difference]: With dead ends: 1292152 [2019-09-08 11:22:53,866 INFO L226 Difference]: Without dead ends: 871352 [2019-09-08 11:22:54,188 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 11:22:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871352 states.