java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:04:22,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:04:22,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:04:22,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:04:22,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:04:22,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:04:22,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:04:22,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:04:22,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:04:22,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:04:22,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:04:22,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:04:22,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:04:22,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:04:22,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:04:22,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:04:22,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:04:22,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:04:22,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:04:22,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:04:22,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:04:22,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:04:22,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:04:22,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:04:22,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:04:22,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:04:22,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:04:22,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:04:22,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:04:22,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:04:22,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:04:22,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:04:22,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:04:22,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:04:22,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:04:22,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:04:22,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:04:22,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:04:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:04:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:04:22,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:04:22,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:04:22,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:04:22,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:04:22,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:04:22,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:04:22,102 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:04:22,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:04:22,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:04:22,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:04:22,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:04:22,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:04:22,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:04:22,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:04:22,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:04:22,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:04:22,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:04:22,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:04:22,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:04:22,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:04:22,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:04:22,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:04:22,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:04:22,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:04:22,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:04:22,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:04:22,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:04:22,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:04:22,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:04:22,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:04:22,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:04:22,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:04:22,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:04:22,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:04:22,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:04:22,181 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:04:22,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:04:22,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325d90ead/10dcbbeb8c7447cbaebdb467049100b8/FLAG9f4aeec2f [2019-09-08 12:04:22,740 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:04:22,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:04:22,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325d90ead/10dcbbeb8c7447cbaebdb467049100b8/FLAG9f4aeec2f [2019-09-08 12:04:23,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325d90ead/10dcbbeb8c7447cbaebdb467049100b8 [2019-09-08 12:04:23,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:04:23,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:04:23,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:23,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:04:23,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:04:23,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fc21ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23, skipping insertion in model container [2019-09-08 12:04:23,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:04:23,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:04:23,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:23,630 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:04:23,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:23,756 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:04:23,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23 WrapperNode [2019-09-08 12:04:23,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:23,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:04:23,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:04:23,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:04:23,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... [2019-09-08 12:04:23,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:04:23,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:04:23,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:04:23,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:04:23,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:04:23,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:04:23,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:04:23,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:04:23,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:04:23,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:04:23,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:04:23,877 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:04:23,878 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:04:23,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:04:23,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:04:23,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:04:24,710 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:04:24,710 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:04:24,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:24 BoogieIcfgContainer [2019-09-08 12:04:24,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:04:24,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:04:24,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:04:24,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:04:24,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:04:23" (1/3) ... [2019-09-08 12:04:24,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71100b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:24, skipping insertion in model container [2019-09-08 12:04:24,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:23" (2/3) ... [2019-09-08 12:04:24,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71100b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:24, skipping insertion in model container [2019-09-08 12:04:24,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:24" (3/3) ... [2019-09-08 12:04:24,726 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:04:24,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:04:24,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:04:24,773 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:04:24,801 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:04:24,802 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:04:24,802 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:04:24,802 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:04:24,802 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:04:24,802 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:04:24,803 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:04:24,803 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:04:24,803 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:04:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:04:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:04:24,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:24,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:24,835 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1568218155, now seen corresponding path program 1 times [2019-09-08 12:04:24,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:24,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:25,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:25,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:25,358 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:04:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:25,543 INFO L93 Difference]: Finished difference Result 301 states and 494 transitions. [2019-09-08 12:04:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:25,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:04:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:25,559 INFO L225 Difference]: With dead ends: 301 [2019-09-08 12:04:25,559 INFO L226 Difference]: Without dead ends: 228 [2019-09-08 12:04:25,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-08 12:04:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-09-08 12:04:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 12:04:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 326 transitions. [2019-09-08 12:04:25,637 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 326 transitions. Word has length 79 [2019-09-08 12:04:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:25,638 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 326 transitions. [2019-09-08 12:04:25,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 326 transitions. [2019-09-08 12:04:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:25,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:25,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:25,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1951668189, now seen corresponding path program 1 times [2019-09-08 12:04:25,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:25,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:25,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:25,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:25,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:25,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:25,857 INFO L87 Difference]: Start difference. First operand 226 states and 326 transitions. Second operand 5 states. [2019-09-08 12:04:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:26,200 INFO L93 Difference]: Finished difference Result 564 states and 852 transitions. [2019-09-08 12:04:26,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:26,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:04:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:26,205 INFO L225 Difference]: With dead ends: 564 [2019-09-08 12:04:26,205 INFO L226 Difference]: Without dead ends: 379 [2019-09-08 12:04:26,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-08 12:04:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2019-09-08 12:04:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:04:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2019-09-08 12:04:26,281 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 81 [2019-09-08 12:04:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:26,282 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2019-09-08 12:04:26,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2019-09-08 12:04:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:26,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:26,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:26,291 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 573425260, now seen corresponding path program 1 times [2019-09-08 12:04:26,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:26,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:26,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:26,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:26,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:26,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:26,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:26,527 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 5 states. [2019-09-08 12:04:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:26,745 INFO L93 Difference]: Finished difference Result 709 states and 1082 transitions. [2019-09-08 12:04:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:26,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:04:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:26,751 INFO L225 Difference]: With dead ends: 709 [2019-09-08 12:04:26,751 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:04:26,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:04:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-09-08 12:04:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:04:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 559 transitions. [2019-09-08 12:04:26,804 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 559 transitions. Word has length 82 [2019-09-08 12:04:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:26,805 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 559 transitions. [2019-09-08 12:04:26,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 559 transitions. [2019-09-08 12:04:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:04:26,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:26,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:26,818 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash -263686482, now seen corresponding path program 1 times [2019-09-08 12:04:26,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:26,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:26,966 INFO L87 Difference]: Start difference. First operand 377 states and 559 transitions. Second operand 5 states. [2019-09-08 12:04:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:27,171 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2019-09-08 12:04:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:27,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 12:04:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:27,175 INFO L225 Difference]: With dead ends: 701 [2019-09-08 12:04:27,175 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:04:27,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:04:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-09-08 12:04:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:04:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-09-08 12:04:27,203 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 83 [2019-09-08 12:04:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:27,204 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-09-08 12:04:27,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-09-08 12:04:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:27,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:27,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:27,207 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash -601320308, now seen corresponding path program 1 times [2019-09-08 12:04:27,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:27,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:27,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:27,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:27,314 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 5 states. [2019-09-08 12:04:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:27,533 INFO L93 Difference]: Finished difference Result 697 states and 1049 transitions. [2019-09-08 12:04:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:27,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 12:04:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:27,538 INFO L225 Difference]: With dead ends: 697 [2019-09-08 12:04:27,538 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:04:27,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:04:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-09-08 12:04:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:04:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 549 transitions. [2019-09-08 12:04:27,567 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 549 transitions. Word has length 84 [2019-09-08 12:04:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:27,568 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 549 transitions. [2019-09-08 12:04:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 549 transitions. [2019-09-08 12:04:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:04:27,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:27,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:27,570 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2143300643, now seen corresponding path program 1 times [2019-09-08 12:04:27,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:27,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:27,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:27,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:27,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:27,694 INFO L87 Difference]: Start difference. First operand 377 states and 549 transitions. Second operand 5 states. [2019-09-08 12:04:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:27,863 INFO L93 Difference]: Finished difference Result 705 states and 1048 transitions. [2019-09-08 12:04:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:27,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:04:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:27,868 INFO L225 Difference]: With dead ends: 705 [2019-09-08 12:04:27,868 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:04:27,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:04:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-09-08 12:04:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:04:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 544 transitions. [2019-09-08 12:04:27,898 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 544 transitions. Word has length 85 [2019-09-08 12:04:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:27,900 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 544 transitions. [2019-09-08 12:04:27,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 544 transitions. [2019-09-08 12:04:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:27,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:27,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:27,902 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1319224778, now seen corresponding path program 1 times [2019-09-08 12:04:27,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:28,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:28,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:28,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:28,084 INFO L87 Difference]: Start difference. First operand 377 states and 544 transitions. Second operand 7 states. [2019-09-08 12:04:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:28,358 INFO L93 Difference]: Finished difference Result 1655 states and 2481 transitions. [2019-09-08 12:04:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:04:28,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 12:04:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:28,369 INFO L225 Difference]: With dead ends: 1655 [2019-09-08 12:04:28,369 INFO L226 Difference]: Without dead ends: 1425 [2019-09-08 12:04:28,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-09-08 12:04:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 490. [2019-09-08 12:04:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 12:04:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 717 transitions. [2019-09-08 12:04:28,436 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 717 transitions. Word has length 86 [2019-09-08 12:04:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:28,436 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 717 transitions. [2019-09-08 12:04:28,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:04:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 717 transitions. [2019-09-08 12:04:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:28,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:28,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:28,438 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1049546299, now seen corresponding path program 1 times [2019-09-08 12:04:28,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:28,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:28,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:28,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:28,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:28,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:28,558 INFO L87 Difference]: Start difference. First operand 490 states and 717 transitions. Second operand 5 states. [2019-09-08 12:04:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:28,745 INFO L93 Difference]: Finished difference Result 1178 states and 1763 transitions. [2019-09-08 12:04:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:28,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:04:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:28,753 INFO L225 Difference]: With dead ends: 1178 [2019-09-08 12:04:28,754 INFO L226 Difference]: Without dead ends: 948 [2019-09-08 12:04:28,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-09-08 12:04:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 780. [2019-09-08 12:04:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-08 12:04:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1163 transitions. [2019-09-08 12:04:28,828 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1163 transitions. Word has length 86 [2019-09-08 12:04:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:28,828 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1163 transitions. [2019-09-08 12:04:28,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1163 transitions. [2019-09-08 12:04:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:28,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:28,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:28,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 992840357, now seen corresponding path program 1 times [2019-09-08 12:04:28,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:28,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:28,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:28,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:28,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:28,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:28,937 INFO L87 Difference]: Start difference. First operand 780 states and 1163 transitions. Second operand 5 states. [2019-09-08 12:04:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:29,155 INFO L93 Difference]: Finished difference Result 1494 states and 2248 transitions. [2019-09-08 12:04:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:29,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:04:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:29,161 INFO L225 Difference]: With dead ends: 1494 [2019-09-08 12:04:29,162 INFO L226 Difference]: Without dead ends: 1146 [2019-09-08 12:04:29,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2019-09-08 12:04:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1018. [2019-09-08 12:04:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-09-08 12:04:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1527 transitions. [2019-09-08 12:04:29,256 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1527 transitions. Word has length 86 [2019-09-08 12:04:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:29,257 INFO L475 AbstractCegarLoop]: Abstraction has 1018 states and 1527 transitions. [2019-09-08 12:04:29,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1527 transitions. [2019-09-08 12:04:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:29,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:29,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:29,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 977114007, now seen corresponding path program 1 times [2019-09-08 12:04:29,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:29,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:29,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:29,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:29,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:29,318 INFO L87 Difference]: Start difference. First operand 1018 states and 1527 transitions. Second operand 3 states. [2019-09-08 12:04:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:29,574 INFO L93 Difference]: Finished difference Result 2570 states and 3873 transitions. [2019-09-08 12:04:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:29,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 12:04:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:29,585 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:04:29,586 INFO L226 Difference]: Without dead ends: 1750 [2019-09-08 12:04:29,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-09-08 12:04:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1720. [2019-09-08 12:04:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1720 states. [2019-09-08 12:04:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2552 transitions. [2019-09-08 12:04:29,816 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2552 transitions. Word has length 86 [2019-09-08 12:04:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:29,817 INFO L475 AbstractCegarLoop]: Abstraction has 1720 states and 2552 transitions. [2019-09-08 12:04:29,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2552 transitions. [2019-09-08 12:04:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:29,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] [2019-09-08 12:04:29,819 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1184012502, now seen corresponding path program 1 times [2019-09-08 12:04:29,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:29,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:29,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:29,884 INFO L87 Difference]: Start difference. First operand 1720 states and 2552 transitions. Second operand 3 states. [2019-09-08 12:04:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:30,126 INFO L93 Difference]: Finished difference Result 3244 states and 4832 transitions. [2019-09-08 12:04:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:30,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 12:04:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:30,138 INFO L225 Difference]: With dead ends: 3244 [2019-09-08 12:04:30,138 INFO L226 Difference]: Without dead ends: 1722 [2019-09-08 12:04:30,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-09-08 12:04:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2019-09-08 12:04:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1720 states. [2019-09-08 12:04:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2544 transitions. [2019-09-08 12:04:30,325 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2544 transitions. Word has length 86 [2019-09-08 12:04:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:30,326 INFO L475 AbstractCegarLoop]: Abstraction has 1720 states and 2544 transitions. [2019-09-08 12:04:30,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2544 transitions. [2019-09-08 12:04:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:30,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:30,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:30,328 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:30,328 INFO L82 PathProgramCache]: Analyzing trace with hash 16626912, now seen corresponding path program 1 times [2019-09-08 12:04:30,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:30,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:30,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:30,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:30,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:30,508 INFO L87 Difference]: Start difference. First operand 1720 states and 2544 transitions. Second operand 7 states. [2019-09-08 12:04:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:31,175 INFO L93 Difference]: Finished difference Result 6589 states and 9805 transitions. [2019-09-08 12:04:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:04:31,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 12:04:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:31,211 INFO L225 Difference]: With dead ends: 6589 [2019-09-08 12:04:31,211 INFO L226 Difference]: Without dead ends: 5505 [2019-09-08 12:04:31,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2019-09-08 12:04:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 2390. [2019-09-08 12:04:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-09-08 12:04:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3540 transitions. [2019-09-08 12:04:31,547 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3540 transitions. Word has length 86 [2019-09-08 12:04:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:31,547 INFO L475 AbstractCegarLoop]: Abstraction has 2390 states and 3540 transitions. [2019-09-08 12:04:31,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:04:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3540 transitions. [2019-09-08 12:04:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:31,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:31,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:31,549 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 379433169, now seen corresponding path program 1 times [2019-09-08 12:04:31,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:31,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:31,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:31,675 INFO L87 Difference]: Start difference. First operand 2390 states and 3540 transitions. Second operand 5 states. [2019-09-08 12:04:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:32,248 INFO L93 Difference]: Finished difference Result 5113 states and 7602 transitions. [2019-09-08 12:04:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:32,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:04:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:32,276 INFO L225 Difference]: With dead ends: 5113 [2019-09-08 12:04:32,276 INFO L226 Difference]: Without dead ends: 4029 [2019-09-08 12:04:32,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2019-09-08 12:04:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 3937. [2019-09-08 12:04:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5852 transitions. [2019-09-08 12:04:32,879 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5852 transitions. Word has length 86 [2019-09-08 12:04:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:32,879 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5852 transitions. [2019-09-08 12:04:32,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5852 transitions. [2019-09-08 12:04:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:04:32,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:32,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:32,882 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 422232126, now seen corresponding path program 1 times [2019-09-08 12:04:32,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:32,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:32,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:33,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:33,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:33,149 INFO L87 Difference]: Start difference. First operand 3937 states and 5852 transitions. Second operand 9 states. [2019-09-08 12:04:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:34,728 INFO L93 Difference]: Finished difference Result 11415 states and 17004 transitions. [2019-09-08 12:04:34,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:04:34,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:04:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:34,774 INFO L225 Difference]: With dead ends: 11415 [2019-09-08 12:04:34,774 INFO L226 Difference]: Without dead ends: 7649 [2019-09-08 12:04:34,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:04:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-08 12:04:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 3937. [2019-09-08 12:04:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5851 transitions. [2019-09-08 12:04:35,259 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5851 transitions. Word has length 87 [2019-09-08 12:04:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:35,259 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5851 transitions. [2019-09-08 12:04:35,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5851 transitions. [2019-09-08 12:04:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:04:35,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:35,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:35,262 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash -16144864, now seen corresponding path program 1 times [2019-09-08 12:04:35,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:35,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:35,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:35,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:04:35,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:04:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:04:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:35,490 INFO L87 Difference]: Start difference. First operand 3937 states and 5851 transitions. Second operand 10 states. [2019-09-08 12:04:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:37,386 INFO L93 Difference]: Finished difference Result 10507 states and 15590 transitions. [2019-09-08 12:04:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:04:37,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 12:04:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:37,402 INFO L225 Difference]: With dead ends: 10507 [2019-09-08 12:04:37,402 INFO L226 Difference]: Without dead ends: 6700 [2019-09-08 12:04:37,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:04:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-09-08 12:04:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 3937. [2019-09-08 12:04:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5848 transitions. [2019-09-08 12:04:37,831 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5848 transitions. Word has length 88 [2019-09-08 12:04:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:37,831 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5848 transitions. [2019-09-08 12:04:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:04:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5848 transitions. [2019-09-08 12:04:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:04:37,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:37,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:37,833 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1990597379, now seen corresponding path program 1 times [2019-09-08 12:04:37,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:04:38,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:04:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:04:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:38,044 INFO L87 Difference]: Start difference. First operand 3937 states and 5848 transitions. Second operand 10 states. [2019-09-08 12:04:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:39,554 INFO L93 Difference]: Finished difference Result 11547 states and 17126 transitions. [2019-09-08 12:04:39,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:39,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 12:04:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:39,571 INFO L225 Difference]: With dead ends: 11547 [2019-09-08 12:04:39,572 INFO L226 Difference]: Without dead ends: 7835 [2019-09-08 12:04:39,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:04:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-09-08 12:04:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 3937. [2019-09-08 12:04:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5836 transitions. [2019-09-08 12:04:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5836 transitions. Word has length 88 [2019-09-08 12:04:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5836 transitions. [2019-09-08 12:04:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:04:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5836 transitions. [2019-09-08 12:04:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:04:40,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:40,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:40,076 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2138935051, now seen corresponding path program 1 times [2019-09-08 12:04:40,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:04:40,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:04:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:04:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:40,298 INFO L87 Difference]: Start difference. First operand 3937 states and 5836 transitions. Second operand 10 states. [2019-09-08 12:04:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:41,874 INFO L93 Difference]: Finished difference Result 11672 states and 17294 transitions. [2019-09-08 12:04:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:41,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 12:04:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:41,891 INFO L225 Difference]: With dead ends: 11672 [2019-09-08 12:04:41,891 INFO L226 Difference]: Without dead ends: 7880 [2019-09-08 12:04:41,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:04:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2019-09-08 12:04:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 3937. [2019-09-08 12:04:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5830 transitions. [2019-09-08 12:04:42,419 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5830 transitions. Word has length 89 [2019-09-08 12:04:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:42,420 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5830 transitions. [2019-09-08 12:04:42,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:04:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5830 transitions. [2019-09-08 12:04:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:04:42,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:42,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:42,422 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1852033779, now seen corresponding path program 1 times [2019-09-08 12:04:42,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:42,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:42,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:42,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:04:42,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:04:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:04:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:42,709 INFO L87 Difference]: Start difference. First operand 3937 states and 5830 transitions. Second operand 10 states. [2019-09-08 12:04:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:44,680 INFO L93 Difference]: Finished difference Result 11627 states and 17216 transitions. [2019-09-08 12:04:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:44,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 12:04:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:44,695 INFO L225 Difference]: With dead ends: 11627 [2019-09-08 12:04:44,696 INFO L226 Difference]: Without dead ends: 7865 [2019-09-08 12:04:44,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:04:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7865 states. [2019-09-08 12:04:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7865 to 3937. [2019-09-08 12:04:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-09-08 12:04:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5820 transitions. [2019-09-08 12:04:45,187 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5820 transitions. Word has length 90 [2019-09-08 12:04:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:45,188 INFO L475 AbstractCegarLoop]: Abstraction has 3937 states and 5820 transitions. [2019-09-08 12:04:45,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:04:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5820 transitions. [2019-09-08 12:04:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:04:45,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:45,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:45,189 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash 913180287, now seen corresponding path program 1 times [2019-09-08 12:04:45,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:46,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:46,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:04:46,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:04:46,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:04:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:04:46,214 INFO L87 Difference]: Start difference. First operand 3937 states and 5820 transitions. Second operand 18 states. [2019-09-08 12:04:46,871 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 12:04:47,063 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:04:47,346 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-08 12:04:47,531 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:04:47,726 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:04:47,914 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:04:48,479 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:04:48,723 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:04:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:53,064 INFO L93 Difference]: Finished difference Result 32930 states and 49068 transitions. [2019-09-08 12:04:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:04:53,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-08 12:04:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:53,127 INFO L225 Difference]: With dead ends: 32930 [2019-09-08 12:04:53,128 INFO L226 Difference]: Without dead ends: 30323 [2019-09-08 12:04:53,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:04:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30323 states. [2019-09-08 12:04:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30323 to 3936. [2019-09-08 12:04:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3936 states. [2019-09-08 12:04:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5812 transitions. [2019-09-08 12:04:54,035 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5812 transitions. Word has length 91 [2019-09-08 12:04:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:54,035 INFO L475 AbstractCegarLoop]: Abstraction has 3936 states and 5812 transitions. [2019-09-08 12:04:54,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:04:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5812 transitions. [2019-09-08 12:04:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:04:54,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:54,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:54,038 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash 107830048, now seen corresponding path program 1 times [2019-09-08 12:04:54,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:54,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:54,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:55,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:55,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:04:55,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:04:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:04:55,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:04:55,127 INFO L87 Difference]: Start difference. First operand 3936 states and 5812 transitions. Second operand 19 states. [2019-09-08 12:04:55,731 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:04:55,918 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:04:56,216 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:04:56,546 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:04:56,728 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:04:57,124 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:04:57,428 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:04:57,601 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:04:57,847 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:05:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:01,379 INFO L93 Difference]: Finished difference Result 18241 states and 27113 transitions. [2019-09-08 12:05:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:05:01,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-09-08 12:05:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:01,400 INFO L225 Difference]: With dead ends: 18241 [2019-09-08 12:05:01,400 INFO L226 Difference]: Without dead ends: 15144 [2019-09-08 12:05:01,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:05:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15144 states. [2019-09-08 12:05:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15144 to 3926. [2019-09-08 12:05:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2019-09-08 12:05:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5792 transitions. [2019-09-08 12:05:02,244 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5792 transitions. Word has length 91 [2019-09-08 12:05:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:02,244 INFO L475 AbstractCegarLoop]: Abstraction has 3926 states and 5792 transitions. [2019-09-08 12:05:02,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:05:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5792 transitions. [2019-09-08 12:05:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:05:02,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:02,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:02,246 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1201313119, now seen corresponding path program 1 times [2019-09-08 12:05:02,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:02,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:03,150 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:05:03,317 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:05:03,523 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:05:03,672 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:05:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:04,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:04,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:05:04,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:05:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:05:04,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:05:04,803 INFO L87 Difference]: Start difference. First operand 3926 states and 5792 transitions. Second operand 30 states. [2019-09-08 12:05:04,958 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:05:06,167 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:05:06,440 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:05:06,739 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-08 12:05:07,128 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2019-09-08 12:05:07,904 WARN L188 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-09-08 12:05:14,379 WARN L188 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 164 DAG size of output: 136 [2019-09-08 12:05:31,887 WARN L188 SmtUtils]: Spent 17.40 s on a formula simplification. DAG size of input: 189 DAG size of output: 158 [2019-09-08 12:05:41,743 WARN L188 SmtUtils]: Spent 9.64 s on a formula simplification. DAG size of input: 201 DAG size of output: 170 [2019-09-08 12:05:42,015 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:05:42,265 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:05:42,659 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:05:43,175 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:05:43,744 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 12:05:44,505 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 12:05:45,226 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:05:45,539 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 12:05:46,060 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 12:05:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:55,680 INFO L93 Difference]: Finished difference Result 26282 states and 39081 transitions. [2019-09-08 12:05:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 12:05:55,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-08 12:05:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:55,704 INFO L225 Difference]: With dead ends: 26282 [2019-09-08 12:05:55,704 INFO L226 Difference]: Without dead ends: 23237 [2019-09-08 12:05:55,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=803, Invalid=3487, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 12:05:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23237 states. [2019-09-08 12:05:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23237 to 3968. [2019-09-08 12:05:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-09-08 12:05:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5846 transitions. [2019-09-08 12:05:56,789 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5846 transitions. Word has length 91 [2019-09-08 12:05:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:56,790 INFO L475 AbstractCegarLoop]: Abstraction has 3968 states and 5846 transitions. [2019-09-08 12:05:56,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:05:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5846 transitions. [2019-09-08 12:05:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:05:56,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:56,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:56,791 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash 435359808, now seen corresponding path program 1 times [2019-09-08 12:05:56,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:56,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:57,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:57,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:57,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:57,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:57,609 INFO L87 Difference]: Start difference. First operand 3968 states and 5846 transitions. Second operand 17 states. [2019-09-08 12:05:58,316 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:05:58,553 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-08 12:05:58,700 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:05:58,860 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:05:59,071 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:05:59,205 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:05:59,435 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:06:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:03,017 INFO L93 Difference]: Finished difference Result 13020 states and 19333 transitions. [2019-09-08 12:06:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:06:03,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-09-08 12:06:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:03,035 INFO L225 Difference]: With dead ends: 13020 [2019-09-08 12:06:03,035 INFO L226 Difference]: Without dead ends: 11462 [2019-09-08 12:06:03,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:06:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11462 states. [2019-09-08 12:06:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11462 to 3944. [2019-09-08 12:06:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-09-08 12:06:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5814 transitions. [2019-09-08 12:06:04,130 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5814 transitions. Word has length 91 [2019-09-08 12:06:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:04,130 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 5814 transitions. [2019-09-08 12:06:04,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:06:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5814 transitions. [2019-09-08 12:06:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:06:04,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:04,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:04,132 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 188709021, now seen corresponding path program 1 times [2019-09-08 12:06:04,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:04,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:04,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:04,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:04,611 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:06:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:04,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:04,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:06:04,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:06:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:06:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:06:04,829 INFO L87 Difference]: Start difference. First operand 3944 states and 5814 transitions. Second operand 14 states. [2019-09-08 12:06:05,462 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:06:05,730 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:06:06,013 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:06:06,462 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:06:06,863 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:06:07,012 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:06:08,320 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 12:06:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:13,576 INFO L93 Difference]: Finished difference Result 25187 states and 37472 transitions. [2019-09-08 12:06:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:06:13,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2019-09-08 12:06:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:13,608 INFO L225 Difference]: With dead ends: 25187 [2019-09-08 12:06:13,608 INFO L226 Difference]: Without dead ends: 22529 [2019-09-08 12:06:13,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:06:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22529 states. [2019-09-08 12:06:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22529 to 3908. [2019-09-08 12:06:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3908 states. [2019-09-08 12:06:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5762 transitions. [2019-09-08 12:06:15,640 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5762 transitions. Word has length 92 [2019-09-08 12:06:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:15,640 INFO L475 AbstractCegarLoop]: Abstraction has 3908 states and 5762 transitions. [2019-09-08 12:06:15,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:06:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5762 transitions. [2019-09-08 12:06:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:06:15,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:15,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:15,642 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -596964940, now seen corresponding path program 1 times [2019-09-08 12:06:15,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:15,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:06:15,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:06:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:06:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:06:15,759 INFO L87 Difference]: Start difference. First operand 3908 states and 5762 transitions. Second operand 4 states. [2019-09-08 12:06:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:17,551 INFO L93 Difference]: Finished difference Result 9045 states and 13426 transitions. [2019-09-08 12:06:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:06:17,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 12:06:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:17,557 INFO L225 Difference]: With dead ends: 9045 [2019-09-08 12:06:17,558 INFO L226 Difference]: Without dead ends: 5345 [2019-09-08 12:06:17,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-09-08 12:06:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 5316. [2019-09-08 12:06:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-09-08 12:06:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 7818 transitions. [2019-09-08 12:06:19,094 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 7818 transitions. Word has length 92 [2019-09-08 12:06:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:19,094 INFO L475 AbstractCegarLoop]: Abstraction has 5316 states and 7818 transitions. [2019-09-08 12:06:19,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:06:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 7818 transitions. [2019-09-08 12:06:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:06:19,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:19,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:19,095 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1323542840, now seen corresponding path program 1 times [2019-09-08 12:06:19,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:19,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:19,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:19,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:06:19,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:06:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:06:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:19,176 INFO L87 Difference]: Start difference. First operand 5316 states and 7818 transitions. Second operand 5 states. [2019-09-08 12:06:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:21,849 INFO L93 Difference]: Finished difference Result 8499 states and 12490 transitions. [2019-09-08 12:06:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:06:21,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:06:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:21,859 INFO L225 Difference]: With dead ends: 8499 [2019-09-08 12:06:21,860 INFO L226 Difference]: Without dead ends: 8497 [2019-09-08 12:06:21,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:06:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8497 states. [2019-09-08 12:06:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8497 to 5352. [2019-09-08 12:06:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5352 states. [2019-09-08 12:06:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 7832 transitions. [2019-09-08 12:06:23,375 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 7832 transitions. Word has length 92 [2019-09-08 12:06:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:23,375 INFO L475 AbstractCegarLoop]: Abstraction has 5352 states and 7832 transitions. [2019-09-08 12:06:23,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 7832 transitions. [2019-09-08 12:06:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:06:23,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:23,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:23,376 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1094426183, now seen corresponding path program 1 times [2019-09-08 12:06:23,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:23,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:24,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:24,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:06:24,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:06:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:06:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:06:24,266 INFO L87 Difference]: Start difference. First operand 5352 states and 7832 transitions. Second operand 19 states. [2019-09-08 12:06:24,867 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:06:25,083 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:06:25,422 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 12:06:25,742 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 12:06:25,960 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:06:26,306 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:06:26,636 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:06:26,813 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:06:27,103 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:06:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:36,339 INFO L93 Difference]: Finished difference Result 31982 states and 47151 transitions. [2019-09-08 12:06:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:06:36,340 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-08 12:06:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:36,368 INFO L225 Difference]: With dead ends: 31982 [2019-09-08 12:06:36,368 INFO L226 Difference]: Without dead ends: 27917 [2019-09-08 12:06:36,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:06:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27917 states. [2019-09-08 12:06:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27917 to 5338. [2019-09-08 12:06:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5338 states. [2019-09-08 12:06:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 7809 transitions. [2019-09-08 12:06:38,218 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 7809 transitions. Word has length 92 [2019-09-08 12:06:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:38,218 INFO L475 AbstractCegarLoop]: Abstraction has 5338 states and 7809 transitions. [2019-09-08 12:06:38,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:06:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 7809 transitions. [2019-09-08 12:06:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:06:38,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:38,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:38,219 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1433027713, now seen corresponding path program 1 times [2019-09-08 12:06:38,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:39,268 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:06:39,498 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:06:39,648 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:06:39,848 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-08 12:06:40,161 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:06:40,351 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:06:40,516 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 12:06:40,701 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:06:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:41,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:41,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:06:41,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:06:41,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:06:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:06:41,528 INFO L87 Difference]: Start difference. First operand 5338 states and 7809 transitions. Second operand 32 states. [2019-09-08 12:06:41,799 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-08 12:06:42,155 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-09-08 12:06:42,661 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-08 12:06:42,862 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-08 12:06:43,092 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:06:43,336 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:06:43,685 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:06:44,366 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:06:44,921 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-08 12:06:45,731 WARN L188 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-08 12:06:46,562 WARN L188 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 103 [2019-09-08 12:06:47,529 WARN L188 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-09-08 12:06:48,632 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 150 DAG size of output: 120 [2019-09-08 12:06:49,796 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-09-08 12:06:51,087 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 175 DAG size of output: 141 [2019-09-08 12:06:51,674 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-08 12:06:52,262 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-08 12:06:52,611 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-08 12:06:53,299 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 107 [2019-09-08 12:06:53,578 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-08 12:06:53,818 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-08 12:06:54,382 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-08 12:06:54,575 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 12:06:54,806 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-08 12:06:55,149 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:06:55,732 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-08 12:06:56,020 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:06:56,355 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 12:06:56,827 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:06:57,096 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 12:06:57,782 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:06:58,367 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:07:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:18,361 INFO L93 Difference]: Finished difference Result 42717 states and 62991 transitions. [2019-09-08 12:07:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 12:07:18,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-08 12:07:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:18,400 INFO L225 Difference]: With dead ends: 42717 [2019-09-08 12:07:18,400 INFO L226 Difference]: Without dead ends: 39278 [2019-09-08 12:07:18,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=800, Invalid=4170, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 12:07:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39278 states. [2019-09-08 12:07:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39278 to 5342. [2019-09-08 12:07:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5342 states. [2019-09-08 12:07:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 7813 transitions. [2019-09-08 12:07:20,564 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 7813 transitions. Word has length 93 [2019-09-08 12:07:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:20,565 INFO L475 AbstractCegarLoop]: Abstraction has 5342 states and 7813 transitions. [2019-09-08 12:07:20,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:07:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 7813 transitions. [2019-09-08 12:07:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:07:20,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:20,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:20,566 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:20,566 INFO L82 PathProgramCache]: Analyzing trace with hash 130994276, now seen corresponding path program 1 times [2019-09-08 12:07:20,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:20,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:20,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:21,085 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:07:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:21,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:07:21,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:07:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:07:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:07:21,310 INFO L87 Difference]: Start difference. First operand 5342 states and 7813 transitions. Second operand 14 states. [2019-09-08 12:07:21,829 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:07:22,021 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:07:22,225 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:07:22,613 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:07:22,929 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:07:23,089 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:07:24,977 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:07:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:35,257 INFO L93 Difference]: Finished difference Result 35205 states and 51865 transitions. [2019-09-08 12:07:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:07:35,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2019-09-08 12:07:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:35,288 INFO L225 Difference]: With dead ends: 35205 [2019-09-08 12:07:35,288 INFO L226 Difference]: Without dead ends: 31114 [2019-09-08 12:07:35,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:07:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31114 states. [2019-09-08 12:07:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31114 to 5313. [2019-09-08 12:07:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5313 states. [2019-09-08 12:07:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5313 states to 5313 states and 7779 transitions. [2019-09-08 12:07:37,535 INFO L78 Accepts]: Start accepts. Automaton has 5313 states and 7779 transitions. Word has length 93 [2019-09-08 12:07:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:37,535 INFO L475 AbstractCegarLoop]: Abstraction has 5313 states and 7779 transitions. [2019-09-08 12:07:37,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:07:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5313 states and 7779 transitions. [2019-09-08 12:07:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:07:37,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:37,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:37,536 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2117744673, now seen corresponding path program 1 times [2019-09-08 12:07:37,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:37,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:37,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:38,279 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:07:39,116 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:07:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:39,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:39,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:07:39,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:07:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:07:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:07:39,922 INFO L87 Difference]: Start difference. First operand 5313 states and 7779 transitions. Second operand 32 states. [2019-09-08 12:07:40,111 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:07:40,974 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 12:07:41,236 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:07:41,605 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 12:07:41,898 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-08 12:07:42,284 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:07:42,749 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:07:43,260 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-09-08 12:07:43,879 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2019-09-08 12:07:44,556 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-09-08 12:07:45,418 WARN L188 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 124 [2019-09-08 12:07:45,693 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 12:07:45,965 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-08 12:07:46,346 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 12:07:46,714 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-08 12:07:46,880 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-08 12:07:47,144 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:07:47,474 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:07:47,776 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:07:51,816 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:08:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:03,855 INFO L93 Difference]: Finished difference Result 24566 states and 36104 transitions. [2019-09-08 12:08:03,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 12:08:03,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-08 12:08:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:03,877 INFO L225 Difference]: With dead ends: 24566 [2019-09-08 12:08:03,877 INFO L226 Difference]: Without dead ends: 22663 [2019-09-08 12:08:03,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=728, Invalid=3304, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 12:08:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22663 states. [2019-09-08 12:08:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22663 to 5321. [2019-09-08 12:08:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5321 states. [2019-09-08 12:08:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 7788 transitions. [2019-09-08 12:08:06,187 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 7788 transitions. Word has length 93 [2019-09-08 12:08:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:06,187 INFO L475 AbstractCegarLoop]: Abstraction has 5321 states and 7788 transitions. [2019-09-08 12:08:06,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:08:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 7788 transitions. [2019-09-08 12:08:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:08:06,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:06,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:06,189 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash 574389371, now seen corresponding path program 1 times [2019-09-08 12:08:06,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:06,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:08:07,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:08:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:08:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:08:07,158 INFO L87 Difference]: Start difference. First operand 5321 states and 7788 transitions. Second operand 18 states. [2019-09-08 12:08:07,783 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-08 12:08:07,973 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:08:08,194 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:08:08,376 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:08:08,560 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:08:08,701 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:08:08,910 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 12:08:09,090 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 12:08:09,369 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:08:09,686 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:08:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:21,828 INFO L93 Difference]: Finished difference Result 30087 states and 44438 transitions. [2019-09-08 12:08:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:08:21,828 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-08 12:08:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:21,855 INFO L225 Difference]: With dead ends: 30087 [2019-09-08 12:08:21,855 INFO L226 Difference]: Without dead ends: 26632 [2019-09-08 12:08:21,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:08:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26632 states. [2019-09-08 12:08:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26632 to 5304. [2019-09-08 12:08:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-09-08 12:08:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 7767 transitions. [2019-09-08 12:08:24,349 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 7767 transitions. Word has length 93 [2019-09-08 12:08:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:24,349 INFO L475 AbstractCegarLoop]: Abstraction has 5304 states and 7767 transitions. [2019-09-08 12:08:24,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:08:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 7767 transitions. [2019-09-08 12:08:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:08:24,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:24,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:24,350 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash 492231610, now seen corresponding path program 1 times [2019-09-08 12:08:24,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:24,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:24,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:24,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:08:24,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:08:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:08:24,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:08:24,850 INFO L87 Difference]: Start difference. First operand 5304 states and 7767 transitions. Second operand 13 states. [2019-09-08 12:08:25,370 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:08:25,594 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:08:25,832 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:08:26,241 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:08:26,525 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:08:26,681 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:08:28,737 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:08:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:39,510 INFO L93 Difference]: Finished difference Result 28798 states and 42447 transitions. [2019-09-08 12:08:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:08:39,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 12:08:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:39,536 INFO L225 Difference]: With dead ends: 28798 [2019-09-08 12:08:39,536 INFO L226 Difference]: Without dead ends: 25906 [2019-09-08 12:08:39,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:08:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25906 states. [2019-09-08 12:08:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25906 to 5303. [2019-09-08 12:08:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-09-08 12:08:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 7765 transitions. [2019-09-08 12:08:42,148 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 7765 transitions. Word has length 93 [2019-09-08 12:08:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:42,148 INFO L475 AbstractCegarLoop]: Abstraction has 5303 states and 7765 transitions. [2019-09-08 12:08:42,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:08:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 7765 transitions. [2019-09-08 12:08:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:08:42,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:42,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:42,150 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:42,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 296923704, now seen corresponding path program 1 times [2019-09-08 12:08:42,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:42,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:08:42,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:08:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:08:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:08:42,831 INFO L87 Difference]: Start difference. First operand 5303 states and 7765 transitions. Second operand 15 states. [2019-09-08 12:08:43,326 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-09-08 12:08:43,550 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:08:43,777 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:08:44,000 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:08:44,206 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 12:08:44,524 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 12:08:44,690 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:08:44,818 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 12:08:45,019 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:08:45,508 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:08:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:55,098 INFO L93 Difference]: Finished difference Result 22317 states and 32932 transitions. [2019-09-08 12:08:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:08:55,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-09-08 12:08:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:55,115 INFO L225 Difference]: With dead ends: 22317 [2019-09-08 12:08:55,115 INFO L226 Difference]: Without dead ends: 18859 [2019-09-08 12:08:55,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:08:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18859 states. [2019-09-08 12:08:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18859 to 5283. [2019-09-08 12:08:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5283 states. [2019-09-08 12:08:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 7742 transitions. [2019-09-08 12:08:57,794 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 7742 transitions. Word has length 94 [2019-09-08 12:08:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:57,794 INFO L475 AbstractCegarLoop]: Abstraction has 5283 states and 7742 transitions. [2019-09-08 12:08:57,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:08:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 7742 transitions. [2019-09-08 12:08:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:08:57,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:57,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:57,795 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 48312984, now seen corresponding path program 1 times [2019-09-08 12:08:57,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:57,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:08:58,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:08:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:08:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:58,223 INFO L87 Difference]: Start difference. First operand 5283 states and 7742 transitions. Second operand 10 states. [2019-09-08 12:09:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:07,309 INFO L93 Difference]: Finished difference Result 19075 states and 28174 transitions. [2019-09-08 12:09:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:09:07,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 12:09:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:07,324 INFO L225 Difference]: With dead ends: 19075 [2019-09-08 12:09:07,324 INFO L226 Difference]: Without dead ends: 17144 [2019-09-08 12:09:07,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:09:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2019-09-08 12:09:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 4890. [2019-09-08 12:09:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-09-08 12:09:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 7180 transitions. [2019-09-08 12:09:09,745 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 7180 transitions. Word has length 94 [2019-09-08 12:09:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:09,745 INFO L475 AbstractCegarLoop]: Abstraction has 4890 states and 7180 transitions. [2019-09-08 12:09:09,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 7180 transitions. [2019-09-08 12:09:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:09:09,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:09,748 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:09,749 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1473940751, now seen corresponding path program 1 times [2019-09-08 12:09:09,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:09,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:09,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:09,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:09,835 INFO L87 Difference]: Start difference. First operand 4890 states and 7180 transitions. Second operand 7 states. [2019-09-08 12:09:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:19,712 INFO L93 Difference]: Finished difference Result 22780 states and 33575 transitions. [2019-09-08 12:09:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:09:19,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:09:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:19,728 INFO L225 Difference]: With dead ends: 22780 [2019-09-08 12:09:19,728 INFO L226 Difference]: Without dead ends: 18000 [2019-09-08 12:09:19,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:09:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18000 states. [2019-09-08 12:09:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18000 to 7664. [2019-09-08 12:09:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7664 states. [2019-09-08 12:09:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7664 states to 7664 states and 11269 transitions. [2019-09-08 12:09:23,555 INFO L78 Accepts]: Start accepts. Automaton has 7664 states and 11269 transitions. Word has length 120 [2019-09-08 12:09:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:23,555 INFO L475 AbstractCegarLoop]: Abstraction has 7664 states and 11269 transitions. [2019-09-08 12:09:23,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7664 states and 11269 transitions. [2019-09-08 12:09:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:09:23,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:23,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:23,558 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1422172717, now seen corresponding path program 1 times [2019-09-08 12:09:23,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:23,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:23,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:23,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:23,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:23,663 INFO L87 Difference]: Start difference. First operand 7664 states and 11269 transitions. Second operand 7 states. [2019-09-08 12:09:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:42,756 INFO L93 Difference]: Finished difference Result 43348 states and 63741 transitions. [2019-09-08 12:09:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:09:42,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:09:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:42,789 INFO L225 Difference]: With dead ends: 43348 [2019-09-08 12:09:42,789 INFO L226 Difference]: Without dead ends: 35830 [2019-09-08 12:09:42,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:09:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35830 states. [2019-09-08 12:09:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35830 to 16400. [2019-09-08 12:09:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16400 states. [2019-09-08 12:09:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16400 states to 16400 states and 24081 transitions. [2019-09-08 12:09:51,042 INFO L78 Accepts]: Start accepts. Automaton has 16400 states and 24081 transitions. Word has length 120 [2019-09-08 12:09:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:51,042 INFO L475 AbstractCegarLoop]: Abstraction has 16400 states and 24081 transitions. [2019-09-08 12:09:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16400 states and 24081 transitions. [2019-09-08 12:09:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:09:51,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:51,044 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:51,045 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1259095623, now seen corresponding path program 1 times [2019-09-08 12:09:51,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:51,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:51,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:51,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:51,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:51,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:51,133 INFO L87 Difference]: Start difference. First operand 16400 states and 24081 transitions. Second operand 7 states. [2019-09-08 12:10:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:26,830 INFO L93 Difference]: Finished difference Result 82880 states and 121213 transitions. [2019-09-08 12:10:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:10:26,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:10:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:26,913 INFO L225 Difference]: With dead ends: 82880 [2019-09-08 12:10:26,913 INFO L226 Difference]: Without dead ends: 66626 [2019-09-08 12:10:26,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66626 states. [2019-09-08 12:10:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66626 to 35092. [2019-09-08 12:10:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35092 states. [2019-09-08 12:10:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35092 states to 35092 states and 51413 transitions. [2019-09-08 12:10:44,208 INFO L78 Accepts]: Start accepts. Automaton has 35092 states and 51413 transitions. Word has length 120 [2019-09-08 12:10:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:44,209 INFO L475 AbstractCegarLoop]: Abstraction has 35092 states and 51413 transitions. [2019-09-08 12:10:44,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:10:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35092 states and 51413 transitions. [2019-09-08 12:10:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:10:44,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:44,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:44,211 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1767863757, now seen corresponding path program 1 times [2019-09-08 12:10:44,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:44,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:44,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:44,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:10:44,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:10:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:10:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:10:44,307 INFO L87 Difference]: Start difference. First operand 35092 states and 51413 transitions. Second operand 7 states. [2019-09-08 12:11:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:44,339 INFO L93 Difference]: Finished difference Result 153596 states and 224681 transitions. [2019-09-08 12:11:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:11:44,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:11:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:44,490 INFO L225 Difference]: With dead ends: 153596 [2019-09-08 12:11:44,491 INFO L226 Difference]: Without dead ends: 118650 [2019-09-08 12:11:44,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:11:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118650 states. [2019-09-08 12:12:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118650 to 74916. [2019-09-08 12:12:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74916 states. [2019-09-08 12:12:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74916 states to 74916 states and 109493 transitions. [2019-09-08 12:12:22,070 INFO L78 Accepts]: Start accepts. Automaton has 74916 states and 109493 transitions. Word has length 120 [2019-09-08 12:12:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:22,071 INFO L475 AbstractCegarLoop]: Abstraction has 74916 states and 109493 transitions. [2019-09-08 12:12:22,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:12:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 74916 states and 109493 transitions. [2019-09-08 12:12:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:12:22,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:22,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:22,075 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 82630097, now seen corresponding path program 1 times [2019-09-08 12:12:22,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:22,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:22,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:22,124 INFO L87 Difference]: Start difference. First operand 74916 states and 109493 transitions. Second operand 3 states. [2019-09-08 12:12:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:58,083 INFO L93 Difference]: Finished difference Result 143832 states and 210039 transitions. [2019-09-08 12:12:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:58,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:12:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:58,167 INFO L225 Difference]: With dead ends: 143832 [2019-09-08 12:12:58,167 INFO L226 Difference]: Without dead ends: 69062 [2019-09-08 12:12:58,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69062 states. [2019-09-08 12:13:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69062 to 52564. [2019-09-08 12:13:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52564 states. [2019-09-08 12:13:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52564 states to 52564 states and 75817 transitions. [2019-09-08 12:13:26,766 INFO L78 Accepts]: Start accepts. Automaton has 52564 states and 75817 transitions. Word has length 120 [2019-09-08 12:13:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:26,766 INFO L475 AbstractCegarLoop]: Abstraction has 52564 states and 75817 transitions. [2019-09-08 12:13:26,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52564 states and 75817 transitions. [2019-09-08 12:13:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:13:26,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:26,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:26,768 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 60321822, now seen corresponding path program 1 times [2019-09-08 12:13:26,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:26,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:26,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:26,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:26,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:26,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:26,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:26,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:26,818 INFO L87 Difference]: Start difference. First operand 52564 states and 75817 transitions. Second operand 3 states. [2019-09-08 12:13:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:52,980 INFO L93 Difference]: Finished difference Result 95276 states and 137415 transitions. [2019-09-08 12:13:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:52,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:13:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:53,043 INFO L225 Difference]: With dead ends: 95276 [2019-09-08 12:13:53,043 INFO L226 Difference]: Without dead ends: 50320 [2019-09-08 12:13:53,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2019-09-08 12:14:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 50318. [2019-09-08 12:14:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50318 states. [2019-09-08 12:14:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50318 states to 50318 states and 71961 transitions. [2019-09-08 12:14:20,358 INFO L78 Accepts]: Start accepts. Automaton has 50318 states and 71961 transitions. Word has length 121 [2019-09-08 12:14:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:20,358 INFO L475 AbstractCegarLoop]: Abstraction has 50318 states and 71961 transitions. [2019-09-08 12:14:20,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 50318 states and 71961 transitions. [2019-09-08 12:14:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:14:20,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:20,364 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:20,364 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1965128749, now seen corresponding path program 1 times [2019-09-08 12:14:20,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:20,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:20,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:20,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:20,424 INFO L87 Difference]: Start difference. First operand 50318 states and 71961 transitions. Second operand 3 states. [2019-09-08 12:14:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:45,716 INFO L93 Difference]: Finished difference Result 96468 states and 137663 transitions. [2019-09-08 12:14:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:45,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 12:14:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:45,768 INFO L225 Difference]: With dead ends: 96468 [2019-09-08 12:14:45,769 INFO L226 Difference]: Without dead ends: 46294 [2019-09-08 12:14:45,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46294 states. [2019-09-08 12:15:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46294 to 44828. [2019-09-08 12:15:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44828 states. [2019-09-08 12:15:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44828 states to 44828 states and 63543 transitions. [2019-09-08 12:15:09,397 INFO L78 Accepts]: Start accepts. Automaton has 44828 states and 63543 transitions. Word has length 148 [2019-09-08 12:15:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:09,398 INFO L475 AbstractCegarLoop]: Abstraction has 44828 states and 63543 transitions. [2019-09-08 12:15:09,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 44828 states and 63543 transitions. [2019-09-08 12:15:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:15:09,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:09,402 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:09,402 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:09,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1950045297, now seen corresponding path program 1 times [2019-09-08 12:15:09,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:09,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:09,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:09,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:09,469 INFO L87 Difference]: Start difference. First operand 44828 states and 63543 transitions. Second operand 3 states. [2019-09-08 12:15:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:57,354 INFO L93 Difference]: Finished difference Result 130170 states and 183721 transitions. [2019-09-08 12:15:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:57,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 12:15:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:57,448 INFO L225 Difference]: With dead ends: 130170 [2019-09-08 12:15:57,449 INFO L226 Difference]: Without dead ends: 85486 [2019-09-08 12:15:57,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85486 states. [2019-09-08 12:16:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85486 to 80360. [2019-09-08 12:16:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80360 states. [2019-09-08 12:16:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80360 states to 80360 states and 113017 transitions. [2019-09-08 12:16:41,023 INFO L78 Accepts]: Start accepts. Automaton has 80360 states and 113017 transitions. Word has length 149 [2019-09-08 12:16:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:41,024 INFO L475 AbstractCegarLoop]: Abstraction has 80360 states and 113017 transitions. [2019-09-08 12:16:41,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 80360 states and 113017 transitions. [2019-09-08 12:16:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:16:41,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:41,031 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:41,031 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 420983028, now seen corresponding path program 1 times [2019-09-08 12:16:41,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:41,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:16:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:41,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:41,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:41,094 INFO L87 Difference]: Start difference. First operand 80360 states and 113017 transitions. Second operand 3 states. [2019-09-08 12:17:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:36,551 INFO L93 Difference]: Finished difference Result 176996 states and 248595 transitions. [2019-09-08 12:17:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:36,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:17:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:36,659 INFO L225 Difference]: With dead ends: 176996 [2019-09-08 12:17:36,659 INFO L226 Difference]: Without dead ends: 96774 [2019-09-08 12:17:36,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96774 states.